Inverting a permutation is as hard as unordered search (Q3002827)
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 5899300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Inverting a permutation is as hard as unordered search |
scientific article; zbMATH DE number 5899300 |
Statements
24 May 2011
0 references
unordered search
0 references
inverting permutations
0 references
query complexity
0 references
quantum algorithm
0 references
hybrid argument
0 references
randomized reduction
0 references
Inverting a permutation is as hard as unordered search (English)
0 references
0.7893859148025513
0 references
0.7868891954421997
0 references
0.78104567527771
0 references
0.7796290516853333
0 references
0.7672349810600281
0 references
