Abstract
We present the surprising result of A. Shamir that the classes IP and PSPACE are the same.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Babai: E-mail and the unexpected power of interaction, Proceedings of the 5th Structure in Complexity Theory Conference, IEEE, 1990, 30-44.
A. Shamir: IP=PSPACE, Journal of the ACM 39 (1992) 869–877.
C. Papadimitriou: Computational Complexity, Addison-Wesley, 1994.
D.P Bovet, P. Crescenzi: Introduction to the Theory of Complexity, Prentice-Hall, 1988.
C. Lund: The Power of Interaction, MIT Press, 1992
V. Pratt: Every prime has a succinct certificate, SIAM Journal of Computing (1975), 214-220.
D. Knuth: The Art of Computer Programming, Vol. 2: Semi-Numerical Algorithms, Addison-Wesley, 1981, page 395, Exercise 17.
E. Kranakis: Primality and Cryptography, John Wiley & Sons, 1986, Section 2.6.
T.H. Cormen, C.E. Leiserson, R.L. Rivest: Introduction to Algorithms, MIT Press, McGraw-Hill, 1990, Chapter 33.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schöning, U., Pruim, R. (1998). IP = PSPACE. In: Gems of Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60322-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-60322-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64352-1
Online ISBN: 978-3-642-60322-8
eBook Packages: Springer Book Archive