Non-deterministic exponential time has two-prover interactive protocols (Q685724): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetization: A new method in structural complexity theory / 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: Q3359734 / 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 the power of multi-prover interactive protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are there interactive protocols for co-NP languages? / 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: Sparse sets in NP-P: EXPTIME versus NEXPTIME / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relativized exponential and probabilistic complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relativized Arthur-Merlin versus Merlin-Arthur games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Nondeterministic Time Complexity Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank

Latest revision as of 10:56, 22 May 2024

scientific article
Language Label Description Also known as
English
Non-deterministic exponential time has two-prover interactive protocols
scientific article

    Statements

    Non-deterministic exponential time has two-prover interactive protocols (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 1993
    0 references
    0 references
    interactive proof systems
    0 references
    verification scheme for multilinearity
    0 references
    program verification
    0 references
    0 references