Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments (Q3614148): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 04:24, 5 February 2024

scientific article
Language Label Description Also known as
English
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
scientific article

    Statements

    Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments (English)
    0 references
    0 references
    0 references
    16 March 2009
    0 references
    quantum computing
    0 references
    lower bounds
    0 references
    query complexity
    0 references
    adversary method
    0 references
    Kolmogorov complexity
    0 references

    Identifiers