Q5005160 (Q5005160): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3002799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Full Characterization of Quantum Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3400478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quantum characterization of NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An oracle builder's toolkit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4289278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity limitations on quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness of Approximation for Quantum Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4637976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proceedings of the forty-second ACM symposium on Theory of computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3166032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4544834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Arthur-Merlin games / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the circuit complexity of PP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank

Latest revision as of 08:38, 26 July 2024

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

    Statements

    0 references
    0 references
    0 references
    0 references
    0 references
    4 August 2021
    0 references
    0 references
    complexity theory
    0 references
    quantum computing
    0 references
    polynomial hierarchy
    0 references
    semidefinite programming
    0 references
    QMA (2)
    0 references
    quantum complexity
    0 references