Complexity limitations on one-turn quantum refereed games (Q6038714): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4542516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sparse approximations to randomized strategies and convex combinations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo algorithms for permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is closed under intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A basic course in probability theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on BPP and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Debaters and the Hardness of Approximating Stochastic Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Playing Games with Algorithms: Algorithmic Combinatorial Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of succinct zero-sum games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PP is closed under truth-table reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity limitations on quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knowledge complexity of interactive proof-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549656 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel approximation of min-max problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two-person zero-sum games in extensive form / 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: Simple strategies for large zero-sum games with applications to complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Arthur-Merlin games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric alternation captures BPP / rank
 
Normal rank
Property / cites work
 
Property / cites work: User-friendly tail bounds for sums of random matrices / 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: Quantum Information Theory / rank
 
Normal rank

Latest revision as of 00:57, 1 August 2024

scientific article; zbMATH DE number 7681313
Language Label Description Also known as
English
Complexity limitations on one-turn quantum refereed games
scientific article; zbMATH DE number 7681313

    Statements

    Complexity limitations on one-turn quantum refereed games (English)
    0 references
    0 references
    0 references
    2 May 2023
    0 references
    quantum computing
    0 references
    complexity theory
    0 references
    game theory
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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