The quantum query complexity of learning multilinear polynomials (Q436558): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sharp quantum versus classical query complexity separations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elements of Information Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Algorithms for Some Hidden Shift Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3396568 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Polynomials over General Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm / rank
 
Normal rank

Latest revision as of 12:36, 5 July 2024

scientific article
Language Label Description Also known as
English
The quantum query complexity of learning multilinear polynomials
scientific article

    Statements

    The quantum query complexity of learning multilinear polynomials (English)
    0 references
    0 references
    25 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    quantum query complexity
    0 references
    Reed-Muller codes
    0 references
    0 references
    0 references