Polynomial degree vs. quantum query complexity (Q2490260)

From MaRDI portal
Revision as of 13:38, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)





scientific article
Language Label Description Also known as
English
Polynomial degree vs. quantum query complexity
scientific article

    Statements

    Polynomial degree vs. quantum query complexity (English)
    0 references
    0 references
    28 April 2006
    0 references
    Quantum lower bounds
    0 references
    Quantum query complexity
    0 references
    Polynomial degree of Boolean functions.
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references