Inverting a permutation is as hard as unordered search (Q3002827): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (5 intermediate revisions by 5 users not shown) | |||
| label / en | label / en | ||
Inverting a permutation is as hard as unordered search | |||
| Property / DOI | |||
| Property / DOI: 10.4086/toc.2011.v007a002 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2168814002 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1007.2899 / rank | |||
Normal rank | |||
| Property / title | |||
Inverting a permutation is as hard as unordered search (English) | |||
| Property / title: Inverting a permutation is as hard as unordered search (English) / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.4086/TOC.2011.V007A002 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:03, 20 December 2024
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
