Quantum and classical query complexities of local search are polynomially related (Q5901075)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Quantum and classical query complexities of local search are polynomially related |
scientific article; zbMATH DE number 5770733
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Quantum and classical query complexities of local search are polynomially related |
scientific article; zbMATH DE number 5770733 |
Statements
Quantum and classical query complexities of local search are polynomially related (English)
0 references
15 August 2010
0 references
0.99508798122406
0 references
0.8581467866897583
0 references
0.8549116253852844
0 references
0.8546053171157837
0 references
0.8536158800125122
0 references
