On the success probability of the two provers in one-round proof systems
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- PSPACE is provable by two provers in one roundPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Algebraic methods for interactive proof systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the power of multi-prover interactive protocolsTheoretical Computer Science, 1994
- IP = PSPACEJournal of the ACM, 1992
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Multi-prover interactive proofs: how to remove intractabilityPublished by Association for Computing Machinery (ACM) ,1988
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- Multiple-person alternationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952