Abstract
This paper discusses howthe major computational complexity classes, P, NP and PSPACE, capture different computational properties of mathematical proofs and reveal newq uantitative aspects of mathematics.
This is a preview of subscription content, log in via an 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
O. Goldreich, S. Micali, and A. Widgerson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In IEEE Symposium on Foundations of Computer Science, pages 174–187, 1986.
S. Goldwasser. Interactive proof systems. In Proceedings of Symposia in Applied Mathematics, pages 108–128. American Mathematical Society, 1989.
J. Hartmanis, D. Ranjan R. Chang, and P. Rohatyi. On IP = PSPACE and theorems with narrow proofs. EATCS-Bulletin, 41:166–174, 1990.
C. Lund, L. Fortnow, H. Karlo., and N. Nisan. Algebraic methods for interactive proofs. In Proceedings 31st IEEE Symp. on the Foundations of Computer Science, pages 1–10, 1990.
A. Shamir. IP = PSPACE. In Proc. 31st IEEE Symp. on the Foundations of Computer Science, pages 11–15, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Hartmanis, J. (2001). Computational Complexity and Mathematical Proofs. In: Wilhelm, R. (eds) Informatics. Lecture Notes in Computer Science, vol 2000. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44577-3_17
Download citation
DOI: https://doi.org/10.1007/3-540-44577-3_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41635-7
Online ISBN: 978-3-540-44577-7
eBook Packages: Springer Book Archive