Simple PCPs with poly-log rate and query complexity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The PCP theorem by gap amplification
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Robust locally testable codes and products of codes
Random Structures & Algorithms
SIGACT news complexity theory column 51
ACM SIGACT News
Locally testable codes and PCPs of almost-linear length
Journal of the ACM (JACM)
The PCP theorem by gap amplification
Journal of the ACM (JACM)
Probabilistically checkable proofs
Communications of the ACM - Being Human in the Digital Age
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
Invariance in property testing
Property testing
Invariance in property testing
Property testing
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
On 2-query codeword testing with near-perfect completeness
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Guest column: the quantum PCP conjecture
ACM SIGACT News
| Hi-index | 0.00 |
In this work we look back into the proof of the PCP Theorem, with the goal of finding new proofs that are "more combinatorial" and arguably simpler. For that we introduce the notion of an assignment tester, which is a strengthening of the standard PCP verifier, in the following sense. Given a statement and an alleged proof for it, while the PCP verifier checks correctness of the statement, the assignment-tester checks correctness of the statement and the proof. This notion enables composition that is truly modular, i.e., one can compose two assignment-testers without any assumptions on how they are constructed. A related notion was independently introduced in [Ben-Sasson et. al. STOC 04]. We provide a toolkit of (non-trivial) generic transformations on assignment testers. These transformations may be interesting in their own right, and allow us to present the following two main results: 1. The first is a new proof of the PCP Theorem. This proof relies on a rather weak assignment tester given as a "black box". From this, we construct combinatorially the full PCP. An important component of this proof is a new combinatorial aggregation technique (i.e., a new transformation that allows the verifier to read fewer, though possibly longer, "pieces" of the proof). An implementation of the black-box tester can be obtained from the algebraic proof techniques that already appear in [4, 10]. Obtaining a combinatorial implementation of this tester would give a purely combinatorial proof for the PCP theorem, which we view as an interesting open problem. 2. Our second construction is a "standalone" combinatorial construction showing NP 驴 PCP[polylog, 1]. This implies, for example, that approximating max-SAT is quasi-NP-hard. This construction relies on a transformation that makes an assignment tester "oblivious": so that the proof locations read are independent of the statement that is being proven. This eliminates, in a rather surprising manner, the need for aggregation in a crucial point in the proof.