Probabilistically checkable proofs

Authors:
Madhu Sudan
Affiliations:
MIT's Computer Science and Artificial Intelligence Laboratory, Cambridge, MA
Venue:
Communications of the ACM - Being Human in the Digital Age
Year:
2009

Citing 26
Cited 1

Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Multi-prover interactive proofs: how to remove intractability assumptions

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Checking computations in polylogarithmic time

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Algebraic methods for interactive proof systems

Journal of the ACM (JACM)
IP = PSPACE

Journal of the ACM (JACM)
On the power of multi-prover interactive protocols

Theoretical Computer Science
Interactive proofs and the hardness of approximating cliques

Journal of the ACM (JACM)
Hardness of approximations

Approximation algorithms for NP-hard problems
The hardness of approximate optima in lattices, codes, and systems of linear equations

Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Probabilistic checking of proofs: a new characterization of NP

Journal of the ACM (JACM)
Proof verification and the hardness of approximation problems

Journal of the ACM (JACM)
A Parallel Repetition Theorem

SIAM Journal on Computing
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Some optimal inapproximability results

Journal of the ACM (JACM)
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness

Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
A 7/8-Approximation Algorithm for MAX 3SAT?

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Assignment Testers: Towards a Combinatorial Proof of the PCP-Theorem

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Simple PCPs with poly-log rate and query complexity

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Guest column: inapproximability results via Long Code based PCPs

ACM SIGACT News
The PCP theorem by gap amplification

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Dispersers, deterministic amplification, and weak random sources

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
How to recycle random bits

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

The status of the P versus NP problem

Communications of the ACM - The Status of the P versus NP Problem

Quantified Score

Hi-index	0.00

Visualization

Abstract

Can a proof be checked without reading it?