PSPACE is provable by two provers in one round

It is shown that every language in PSPACE, or equivalently every language accepted by an unbounded round interactive proof system, has a one-round, two-prover interactive proof with exponentially small error probability. To obtain this result, the correctness of a simple but powerful method for parallelizing two-prover interactive proofs to reduce their error is proved.<<ETX>>

[1]  Warren Bower.  New directions , 1937 .

[2]  Richard J. Lipton,et al.  Playing Games of Incomplete Information , 1990, Symposium on Theoretical Aspects of Computer Science.

[3]  Avi Wigderson,et al.  Multi-prover interactive proofs: how to remove intractability assumptions , 2019, STOC '88.

[4]  L. Fortnow.  Complexity-Theoretic Aspects of Interactive Proof Systems , 1989 .

[5]  László Babai,et al.  Trading group theory for randomness , 1985, STOC '85.

[6]  Shafi Goldwasser,et al.  Private coins versus public coins in interactive proof systems , 1986, STOC '86.

[7]  László Babai,et al.  Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes , 1988, J. Comput. Syst. Sci..

[8]  Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[9]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[10]  Joan Feigenbaum,et al.  Hiding Instances in Multioracle Queries , 1990, STACS.

[11]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[12]  Richard J. Lipton,et al.  On bounded round multiprover interactive proof systems , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[13]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[14]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[15]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[16]  Richard J. Lipton,et al.  On Games of Incomplete Information , 1992, Theor. Comput. Sci..

[17]  Adi Shamir,et al.  Fully parallelized multi prover protocols for NEXP-time , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[18]  László Lovász,et al.  Two-prover one-round proof systems: their power and their problems (extended abstract) , 1992, STOC '92.

[19]  Seinosuke Toda.  On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[20]  L. Fortnow,et al.  On the power of multi-power interactive protocols , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[21]  Richard J. Lipton,et al.  New Directions In Testing , 1989, Distributed Computing And Cryptography.

[22]  Uriel Feige.  On the success probability of the two provers in one-round proof systems , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.