Computational Complexity and Mathematical Proofs

Dagstuhl Seminars, pp. 251-256, 2001.

Cited by: 1|Bibtex|Views9|Links
EI
Keywords:
mathematical proofsmajor computational complexity classcomputational complexitymathematical proofdifferent computational propertyMore(2+)

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.

Code:

Data:

Your rating :
0

 

Tags
Comments