Nearly-linear size holographic proofs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Impossibility results for recycling random bits in two-prover proof systems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
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)
SIAM Journal on Computing
Locally Testable Codes and PCPs of Almost-Linear Length
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A Combinatorial Consistency Lemma with Application to Proving the PCP Theorem
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Robust pcps of proximity, shorter pcps and applications to coding
STOC '04 Proceedings of the thirty-sixth 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
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
IEEE Transactions on Information Theory - Part 1
Sub-constant error low degree test of almost-linear size
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the fourier tails of bounded functions over the discrete cube
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Locally testable codes and PCPs of almost-linear length
Journal of the ACM (JACM)
Combinatorial construction of locally testable codes
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Revisiting the Efficiency of Malicious Two-Party Computation
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Probabilistic Proof Systems: A Primer
Foundations and Trends® in Theoretical Computer Science
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
A new line of attack on the dichotomy conjecture
Proceedings of the forty-first annual ACM symposium on Theory of computing
Composition of Semi-LTCs by Two-Wise Tensor Products
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Tolerant Linearity Testing and Locally Testable Codes
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Derandomizing graph tests for homomorphism
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
On the derandomization of the graph test for homomorphism over groups
Theoretical Computer Science
Complexity of Stoquastic Frustration-Free Hamiltonians
SIAM Journal on Computing
Guest column: testing linear properties: some general theme
ACM SIGACT News
Short locally testable codes and proofs: a survey in two parts
Property testing
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
Short locally testable codes and proofs: a survey in two parts
Property testing
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
On parameterized approximability
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Robust local testability of tensor products of LDPC codes
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Cones of multipowers and combinatorial optimization problems
Computational Mathematics and Mathematical Physics
| Hi-index | 0.00 |
We present a new proof of the PCP theorem that is based on a combinatorial amplification lemma. The unsat value of a set of constraints C = (c1,...,cn), denoted UNSAT(C), is the smallest fraction of unsatisfied constraints, ranging over all possible assignments for the underlying variables.We describe a new combinatorial amplification transformation that doubles the unsat-value of a constraint-system, with only a linear blowup in the size of the system. The amplification step causes an increase in alphabet-size that is corrected by a PCP composition step. Iterative application of these two steps yields a proof for the PCP theorem.The amplification lemma relies on a new notion of "graph powering" that can be applied to systems of constraints. This powering amplifies the unsat-value of a constraint system provided that the underlying graph structure is an expander.We also apply the amplification lemma to construct PCPs and locally-testable codes whose length is linear up to a polylog factor, and whose correctness can be probabilistically verified by making a constant number of queries. Namely, we prove SAT ∈ PCP1/2,1[log2(n • poly log n),O(1)].