Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation (Q2870055)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6247351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation |
scientific article; zbMATH DE number 6247351 |
Statements
Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation (English)
0 references
17 January 2014
0 references
0.9318731
0 references
0.87961996
0 references
0.8781143
0 references
0.87036437
0 references
0.8683468
0 references
0.86589354
0 references
0.85997844
0 references
