Unbounded-error quantum query complexity (Q638526): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3002757 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on quantum black-box complexity of almost all Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of voting polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perceptrons, PP, and the polynomial hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542521 / 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: Schwankung von Polynomen zwischen Gitterpunkten. (Oscillations of polynomials between lattice points) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear lower bound on the unbounded error probabilistic communication complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between communication complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded-Error One-Way Classical and Quantum Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded-Error Classical and Quantum Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Quantum Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Weakly Nondeterministic Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degree of Boolean functions as real polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal properties of polynomial threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum communication complexity of symmetric predicates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halfspace matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Quantum Query and Communication Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tightness of the Buhrman-Cleve-Wigderson Simulation / rank
 
Normal rank

Revision as of 10:22, 4 July 2024

scientific article
Language Label Description Also known as
English
Unbounded-error quantum query complexity
scientific article

    Statements

    Unbounded-error quantum query complexity (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2011
    0 references
    quantum computing
    0 references
    query complexity
    0 references
    communication complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers