On the number of queries necessary to identify a permutation (Q3768415)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of queries necessary to identify a permutation |
scientific article; zbMATH DE number 4026845
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of queries necessary to identify a permutation |
scientific article; zbMATH DE number 4026845 |
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
0.826640784740448
0 references
0.7894708514213562
0 references
0.7818606495857239
0 references
0.7778375148773193
0 references
0.7659797668457031
0 references
