The quantum query complexity of learning multilinear polynomials (Q436558)
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: The quantum query complexity of learning multilinear polynomials |
scientific article; zbMATH DE number 6059683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The quantum query complexity of learning multilinear polynomials |
scientific article; zbMATH DE number 6059683 |
Statements
The quantum query complexity of learning multilinear polynomials (English)
0 references
25 July 2012
0 references
computational complexity
0 references
quantum query complexity
0 references
Reed-Muller codes
0 references
0.876971960067749
0 references
0.851114809513092
0 references
0.809852659702301
0 references
0.7962601184844971
0 references
