Polynomials, quantum query complexity, and Grothendieck's inequality (Q5368759): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Polynomials, quantum query complexity, and Grothendieck's inequality
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1511.08682 / rank
 
Normal rank
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 11: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

    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum algorithms
    0 references
    Boolean functions
    0 references
    approximation by polynomials
    0 references
    Grothendieck's inequality
    0 references
    0 references
    0 references
    Polynomials, quantum query complexity, and Grothendieck's inequality (English)
    0 references