Polynomials, quantum query complexity, and Grothendieck's inequality (Q5368759): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
label / en | label / en | ||
Polynomials, quantum query complexity, and Grothendieck's inequality | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2963739445 / rank | |||
Normal rank | |||
Property / title | |||
Polynomials, quantum query complexity, and Grothendieck's inequality (English) | |||
Property / title: Polynomials, quantum query complexity, and Grothendieck's inequality (English) / rank | |||
Normal rank |
Latest revision as of 10:34, 30 July 2024
scientific article; zbMATH DE number 6789290
Language | Label | Description | Also known as |
---|---|---|---|
English | Polynomials, quantum query complexity, and Grothendieck's inequality |
scientific article; zbMATH DE number 6789290 |
Statements
10 October 2017
0 references
quantum algorithms
0 references
Boolean functions
0 references
approximation by polynomials
0 references
Grothendieck's inequality
0 references
Polynomials, quantum query complexity, and Grothendieck's inequality (English)
0 references