The complexity of debate checking (Q493647): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Two-way finite automata with quantum and classical states. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-deterministic exponential time has two-prover interactive protocols / 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: On non-determinacy in simple computing devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-bounded probabilistic game automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the max word problem and the power of one-way interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proof systems with polynomially bounded strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state verifiers I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-knowledge proofs of identity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527018 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional dynamic logic of regular programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating multihead finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation in interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3355236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multihead two-way probabilistic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5414546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of two-player games of incomplete information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite State Verifiers with Constant Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: IP = PSPACE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded-error quantum computation with small space bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Alternation / rank
 
Normal rank

Latest revision as of 18:05, 10 July 2024

scientific article
Language Label Description Also known as
English
The complexity of debate checking
scientific article

    Statements

    The complexity of debate checking (English)
    0 references
    0 references
    0 references
    0 references
    4 September 2015
    0 references
    incomplete information debates
    0 references
    private alternation
    0 references
    games
    0 references
    probabilistic computation
    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