The PCP theorem encapsulates the idea that randomization allows the immediate verification of any mathematical proof. A simple route to this striking result was proposed earlier this year.
This is a preview of subscription content, access via your institution
Access options
Subscribe to this journal
Receive 51 print issues and online access
$199.00 per year
only $3.90 per issue
Buy this article
- Purchase on Springer Link
- Instant access to full article PDF
Prices may be subject to local taxes which are calculated during checkout
References
Arora, S. & Safra, S. J. Assoc. Comput. Machin. 45, 70–122 (1998).
Arora, S., Lund, C., Motwani, R., Sudan, M. & Szegedy, M. J. Assoc. Comput. Machin. 45, 501–555 (1998).
Dinur, I. Proc. 38th Annu. ACM Symp. Theor. Comput. 241–250 (2006).
Håstad, J. J. Assoc. Comput. Machin. 48, 798–859 (2001).
Appel, K., Haken, W. & Koch, J. J. Math. 21, 439–567 (1977).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chazelle, B. Proof at a roll of the dice. Nature 444, 1018–1019 (2006). https://doi.org/10.1038/4441018a
Published:
Issue Date:
DOI: https://doi.org/10.1038/4441018a
