132
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...