Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
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)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
PCP characterizations of NP: towards a polynomially-small error-probability
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the efficiency of local decoding procedures for error-correcting codes
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Some optimal inapproximability results
Journal of the ACM (JACM)
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Simple analysis of graph tests for linearity and PCP
Random Structures & Algorithms
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
Guest column: inapproximability results via Long Code based PCPs
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)
Parallel repetition: simplifications and the no-signaling case
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Towards 3-query locally decodable codes of subexponential length
Journal of the ACM (JACM)
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
SIAM Journal on Computing
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
SIAM Journal on Computing
Parallel repetition in projection games and a concentration bound
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Sub-Constant Error Low Degree Test of Almost-Linear Size
SIAM Journal on Computing
Short PCPs with Polylog Query Complexity
SIAM Journal on Computing
PCPs with small soundness error
ACM SIGACT News
3-query locally decodable codes of subexponential length
Proceedings of the forty-first annual ACM symposium on Theory of computing
Limitation on the rate of families of locally testable codes
Property testing
Limitation on the rate of families of locally testable codes
Property testing
Satisfying degree-d equations over GF[2]n
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
ESA'11 Proceedings of the 19th European conference on Algorithms
On the hardness of pricing loss-leaders
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Guest column: algebraic construction of projection PCPs
ACM SIGACT News
A new point of NP-hardness for unique games
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximating MAX SAT by moderately exponential and parameterized algorithms
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Delegation of computation with verification outsourcing: curious verifiers
Proceedings of the 2013 ACM symposium on Principles of distributed computing
On the concrete efficiency of probabilistically-checkable proofs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover
ACM Transactions on Computation Theory (TOCT)
Hi-index | 0.00 |
We show that the NP-Complete language 3Sat has a PCP verifier that makes two queries to a proof of almost-linear size and achieves subconstant probability of error ϵ=o(1). The verifier performs only projection tests, meaning that the answer to the first query determines at most one accepting answer to the second query. The number of bits representing a symbol in the proof depends only on the error ϵ. Previously, by the parallel repetition theorem, there were PCP Theorems with two-query projection tests, but only (arbitrarily small) constant error and polynomial size. There were also PCP Theorems with subconstant error and almost-linear size, but a constant number of queries that is larger than 2. As a corollary, we obtain a host of new results. In particular, our theorem improves many of the hardness of approximation results that are proved using the parallel repetition theorem. A partial list includes the following: (1) 3Sat cannot be efficiently approximated to within a factor of 7/8+o(1), unless P=NP. This holds even under almost-linear reductions. Previously, the best known NP-hardness factor was 7/8+ϵ for any constant ϵ0, under polynomial reductions (Håstad). (2) 3Lin cannot be efficiently approximated to within a factor of 1/2+o(1), unless P=NP. This holds even under almost-linear reductions. Previously, the best known NP-hardness factor was 1/2+ϵ for any constant ϵ0, under polynomial reductions (Håstad). (3) A PCP Theorem with amortized query complexity 1 + o(1) and amortized free bit complexity o(1). Previously, the best-known amortized query complexity and free bit complexity were 1+ϵ and ϵ, respectively, for any constant ϵ0 (Samorodnitsky and Trevisan). One of the new ideas that we use is a new technique for doing the composition step in the (classical) proof of the PCP Theorem, without increasing the number of queries to the proof. We formalize this as a composition of new objects that we call Locally Decode/Reject Codes (LDRC). The notion of LDRC was implicit in several previous works, and we make it explicit in this work. We believe that the formulation of LDRCs and their construction are of independent interest.