IP = PSPACE

In this paper, it is proven that when both randomization and interaction are allowed, the proofs that can be verified in polynomial time are exactly those proofs that can be generated with polynomial space.

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

[2]  Stathis Zachos,et al.  Does co-NP Have Short Interactive Proofs? , 1987, Inf. Process. Lett..

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

[4]  Carsten Lund,et al.  Algebraic methods for interactive proof systems , 1992, JACM.

[5]  Moshe Tennenholtz,et al.  The Noisy Oracle Problem , 1988, CRYPTO.

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

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

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

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

[10]  Vaughan R. Pratt,et al.  Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

[11]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

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

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  László Babai,et al.  E-mail and the unexpected power of interaction , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

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