Polynomial degree vs. quantum query complexity (Q2490260)
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: Polynomial degree vs. quantum query complexity |
scientific article; zbMATH DE number 5021332
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial degree vs. quantum query complexity |
scientific article; zbMATH DE number 5021332 |
Statements
Polynomial degree vs. quantum query complexity (English)
0 references
28 April 2006
0 references
Quantum lower bounds
0 references
Quantum query complexity
0 references
Polynomial degree of Boolean functions.
0 references
0 references
0.9151225
0 references
0.8871168
0 references
0 references
0.8803526
0 references
0.87886626
0 references
0 references
0.8734243
0 references
