Probabilistically checkable proofs
Name
Sudan_Probabilistically checkable.PDF
Size
203.27 KB
Format
Adobe PDF
Checksum (MD5)
aaf3e0b85ab548471d83e38a106e58d7
Author(s)
Sudan, Madhu
Date Issued
March 2009
Journal
Communications of the ACM
Publisher
Association for Computing Machinery
Citation
Sudan, Madhu. “Probabilistically checkable proofs.” Commun. ACM 52.3 (2009): 76-84.
Version
Author's final manuscript
Abstract
Can a proof be checked without reading it? That certainly
seems impossible, no matter how much reviewers of mathematical
papers may wish for this. But theoretical computer
science has shown that we can get very close to this objective!
Namely random consistency checks could reveal errors
in proofs, provided one is careful in choosing the format in
which proofs should be written. In this article we explain
this notion, constructions of such probabilistically checkable
proofs, and why this is important to all of combinatorial
optimization.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
http://dx.doi.org/10.1145/1467247.1467267
