Q5089146 (Q5089146): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Quantum certificate complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separations in query complexity using cheat sheets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds for the collision and the element distinctness problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by quantum arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial degree vs. quantum query complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separations in Query Complexity Based on Pointer Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adversary lower bound for the k-sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures and decision tree complexity: a survey. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangles Are Nonnegative Juntas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Communication vs. Partition Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3187177 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Query Complexity of State Conversion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strong direct product theorem for quantum query complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation of the monotone NC hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete problem for statistical zero knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making polynomials robust to noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-knowledge against quantum attacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Quantum Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of Ambainis lower bounds / rank
 
Normal rank

Revision as of 15:44, 29 July 2024

scientific article; zbMATH DE number 7559363
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7559363

    Statements

    0 references
    0 references
    18 July 2022
    0 references
    quantum query complexity
    0 references
    quantum algorithms
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references