Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments (Q3614148): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051165831 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: quant-ph/0311189 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:53, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments |
scientific article |
Statements
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments (English)
0 references
16 March 2009
0 references
quantum computing
0 references
lower bounds
0 references
query complexity
0 references
adversary method
0 references
Kolmogorov complexity
0 references
