IP = PSPACE

@article{Shamir1992IPP,
  title={IP = PSPACE},
  author={A. Shamir},
  journal={J. ACM},
  year={1992},
  volume={39},
  pages={869-877}
}
  • A. Shamir
  • Published 1992
  • Mathematics, Computer Science
  • J. ACM
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. 
742 Citations

Topics from this paper

Proofs for Quantified Boolean Formulas
  • Highly Influenced
Two-Message Quantum Interactive Proofs Are in PSPACE
  • 59
  • PDF
IP = SPACE: simplified proof
  • A. Shen
  • Mathematics, Computer Science
  • JACM
  • 1992
  • 44
Computational Complexity and Mathematical Proofs
QIP = PSPACE
  • 30
Interactive Proof Systems and Alternating Time-Space Complexity
  • 9
Probabilistically checkable proofs and their consequences for approximation algorithms
  • 15
  • PDF
More on BPP and the Polynomial-Time Hierarchy
  • R. Canetti
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1996
  • 58
Progress on Polynomial Identity Testing - II
  • Nitin Saxena
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
  • 2013
  • 80
  • PDF
On Random Oracle Separations
  • R. V. Book
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1991
  • 25
...
1
2
3
4
5
...