On the power of multi-prover interactive protocols
- 1 November 1994
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 134 (2) , 545-557
- https://doi.org/10.1016/0304-3975(94)90251-8
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Algebraic methods for interactive proof systemsJournal of the ACM, 1992
- IP = PSPACEJournal of the ACM, 1992
- On games of incomplete informationTheoretical Computer Science, 1992
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Are there interactive protocols for co-NP languages?Information Processing Letters, 1988
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987