Gillat Kol
ABSTRACT
The Unique Games Conjecture (UGC) is an important open problem in the research of PCPs and hardness of approximation. The conjecture is a strengthening of the PCP Theorem, predicting the existence of a special type of PCP verifiers: 2-query verifiers that only make unique tests. Moreover, the UGC predicts that such PCP verifiers can have almost-perfect completeness and low-soundness.
The computational complexity notion of a PCP is closely related to the combinatorial notion of a Locally Testable Code (LTC). LTCs are error-correcting codes with codeword testers that only make a constant number of queries to the tested word. All known PCP constructions use LTCs as building blocks. Furthermore, to obtain PCPs with certain properties, one usually uses LTCs with corresponding properties.
In light of the strong connection between PCPs and LTCs, one may conjecture the existence of LTCs with properties similar to the ones required by the UGC. In this work we show limitations on such LTCs: We consider 2-query LTCs with codeword testers that only make unique tests. Roughly speaking, we show that any such LTC with relative distance close to 1, almost-perfect completeness and low-soundness, is of constant size.
While our result does not imply anything about the correctness of the UGC, it does show some limitations of unique tests, compared, for example, to projection tests.
- Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501--555, 1998. Google Scholar
Digital Library
- Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 45(1):70--122, 1998. Google ScholarDigital Library
- Sanjeev Arora and Madhu Sudan. Improved low-degree testing and its applications. Combinatorica, 23(3):365--426, 2003.Google ScholarCross Ref
- László Babai, Lance Fortnow, and Carsten Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1:3--40, 1991.Google ScholarCross Ref
- Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, and Salil P. Vadhan. Robust PCPs of proximity, shorter PCPs, and applications to coding. SIAM Journal on Computing, 36(4):889--974, 2006. Google ScholarDigital Library
- Eli Ben-Sasson, Oded Goldreich, and Madhu Sudan. Bounds on 2-query codeword testing. RANDOM-APPROX, pages 216--227, 2003.Google ScholarCross Ref
- Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuval Rabani, and D. Sivakumar. On the hardness of approximating multicut and sparsest-cut. Computational Complexity, 15(2):94--114, 2006. Google ScholarDigital Library
- Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, and Shmuel Safra. PCP characterizations of NP: towards a polynomially-small error-probability. STOC, pages 29--40, 1999. Google ScholarDigital Library
- Irit Dinur, Elchanan Mossel, and Oded Regev. Conditional hardness for approximate coloring. STOC, pages 344--353, 2006. Google ScholarDigital Library
- Uriel Feige, Shafi Goldwasser, Laszlo Lovász, Shmuel Safra, and Mario Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43(2):268--292, 1996. Google ScholarDigital Library
- Oded Goldreich and Madhu Sudan. Locally testable codes and PCPs of almost-linear length. Journal of the ACM, 53(4):558--655, 2006. Google ScholarDigital Library
- Venkatesan Guruswami. On 2-query codeword testing with near-perfect completeness. ISAAC, pages 267--276, 2006. Google ScholarDigital Library
- Subhash Khot. On the power of unique 2-prover 1-round games. STOC, pages 767--775, 2002. Google ScholarDigital Library
- Subhash Khot, Guy Kindler, Elchanan Mossel, and Ryan O'Donnell. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? Journal of the ACM, 37(1):319--357, 2007. Google ScholarDigital Library
- Subhash Khot and Oded Regev. Vertex cover might be hard to approximate to within 2-ε. Journal of Computer and System Sciences, 74(3):335--349, 2008. Google ScholarDigital Library
- Subhash Khot and Nisheeth K. Vishnoi. The unique games conjecture, integrality gap for cut problems and embeddability of negative type metrics into l
1. FOCS, pages 53--62, 2005. Google ScholarDigital Library
- Dana Moshkovitz and Ran Raz. Sub-constant error probabilistically checkable proof of almost linear size. ECCC Report TR07-026, 2007.Google Scholar
- Dana Moshkovitz and Ran Raz. Sub-constant error low degree test of almost-linear size. SIAM Journal on Computing, 38(1):140--180, 2008. Google ScholarDigital Library
- Dana Moshkovitz and Ran Raz. Two query PCP with sub-constant error. FOCS, pages 314--323, 2008. Google ScholarDigital Library
- Elchanan Mossel, Ryan O'Donnell, and Krzysztof Oleszkiewicz. Noise stability of functions with low influences: invariance and optimality. FOCS, pages 21--30, 2005. Google ScholarDigital Library
- Prasad Raghavendra. Optimal algorithms and inapproximability results for every CSP? STOC, pages 245--254, 2008. Google ScholarDigital Library
- Ran Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763--803, 1998. Google ScholarDigital Library
- Ran Raz and Shmuel Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. STOC, pages 475--484, 1997. Google ScholarDigital Library
Index Terms
- Bounds on locally testable codes with unique tests
Recommendations
Bounds on 2-query Locally Testable Codes with affine tests
We study Locally Testable Codes (LTCs) that can be tested by making two queries to the tested word using an affine test.We show that such LTCs, with high minimal distance, must be of constant size.Our main motivation in studying such LTCs is the Unique ...
Derandomizing polynomial identity tests means proving circuit lower bounds
We show that derandomizing Polynomial Identity Testing is essentially equivalent to proving arithmetic circuit lower bounds for NEXP. More precisely, we prove that if one can test in polynomial time (or even nondeterministic subexponential time, ...
Towards lower bounds on locally testable codes via density arguments
Selected papers from the 26th Annual IEEE Conference on Computational Complexity (CCC 2011)The main open problem in the area of locally testable codes (LTCs) is whether there exists an asymptotically good family of LTCs, and to resolve this question, it suffices to consider the case of query complexity 3. We argue that to refute the existence ...
Comments