Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Fully parallelized multi prover protocols for NEXP-time (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Hiding Instances in Multioracle Queries
STACS '90 Proceedings of the 7th Annual Symposium on Theoretical Aspects of Computer Science
A formalization of the Turing test
ACM SIGART Bulletin
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum multi-prover interactive proof systems with limited prior entanglement
Journal of Computer and System Sciences
Polynomial-space approximation of no-signaling provers
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Entangled Games Are Hard to Approximate
SIAM Journal on Computing
| Hi-index | 0.00 |
We show that every language in PSPACE, or equivalently, every language accepted by an unbounded round interactive proof system, ha a 1-round, 2-prover interactive proof system with exponentially small error probability. To obtain this result, we prove the correctness of a simple but powerful method for parallelizing 2-prover interactive proof systems to reduce their error.