# IP = PSPACE

@article{Shamir1992IPP, title={IP = PSPACE}, author={A. Shamir}, journal={J. ACM}, year={1992}, volume={39}, pages={869-877} }

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.

#### Supplemental Presentations

#### Topics from this paper

#### Paper Mentions

#### 742 Citations

Two-Message Quantum Interactive Proofs Are in PSPACE

- Mathematics, Computer Science
- 2009 50th Annual IEEE Symposium on Foundations of Computer Science
- 2009

59- PDF

Interactive Proof Systems and Alternating Time-Space Complexity

- Computer Science
- Theor. Comput. Sci.
- 1993

9

Probabilistically checkable proofs and their consequences for approximation algorithms

- Computer Science, Mathematics
- Discret. Math.
- 1994

15- PDF

Progress on Polynomial Identity Testing - II

- Mathematics, Computer Science
- Electron. Colloquium Comput. Complex.
- 2013

80- PDF