Inverting a permutation is as hard as unordered search (Q3002827)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inverting a permutation is as hard as unordered search |
scientific article |
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
