Computational Complexity and Mathematical Proofs

Authors:
Juris Hartmanis
Affiliations:
-
Venue:
Informatics - 10 Years Back. 10 Years Ahead.
Year:
2001

Citing 3
Cited 0

Proofs that yield nothing but their validity and a methodology of cryptographic protocol design

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Algebraic methods for interactive proof systems

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
IP=PSPACE (interactive proof=polynomial space)

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.