On the number of queries necessary to identify a permutation (Q3768415)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of queries necessary to identify a permutation |
scientific article |
Statements
On the number of queries necessary to identify a permutation (English)
0 references
1986
0 references
searching
0 references
two-person query game
0 references
minimum number of queries required to identify an unknown permutation
0 references
polynomial-time algorithm
0 references
size of the search space
0 references
