Combinatorial PCPs with short proofs

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2012, Pages 345-355

  Meir, Or ^a  

^a Stanford University   (United States)

Author keywords

Computation theory; Computational and artificial intelligence; Computational complexity; Computational intelligence

Indexed keywords

ALGEBRAIC CONSTRUCTIONS; ALTERNATIVE APPROACH; COMBINATORIAL APPROACH; COMBINATORIAL TECHNIQUES; ERROR CORRECTING CODE; INTUITIVE PROOF; LOW DEGREE; PCP THEOREM; POLYNOMIAL LENGTH; PROOF-LENGTH; QUASI-LINEAR; STATE OF THE ART;

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; MACHINERY; POLYNOMIALS; THEOREM PROVING;

COMBINATORIAL MATHEMATICS;

EID: 84866505607     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2012.14     Document Type: Conference Paper

References (22)

1. S. Arora and S. Safra, "Probabilistic checkable proofs: A new characterization of NP," Journal of ACM volume, vol. 45, no. 1, pp. 70-122, 1998, preliminary version in FOCS 1992.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and intractability of approximation problems," Journal of ACM, vol. 45, no. 3, pp. 501-555, 1998, preliminary version in FOCS 1992.
3. I. Dinur, "The PCP theorem by gap amplification," Journal of ACM, vol. 54, no. 3, pp. 241-250, 2007, preliminary version in STOC 2006.
4. O. Goldreich and S. Safra, "A combinatorial consistency lemma with application to proving the PCP theorem," SIAM J. Comput., vol. 29, no. 4, pp. 1132-1154, 2000.
5. I. Dinur and O. Reingold, "Assignment testers: Towards combinatorial proof of the PCP theorem," SIAM Journal of Computing, vol. 36, no. 4, pp. 155-164, 2006.
6. I. Dinur and O. Meir, "Derandomized parallel repetition of structured PCPs," in IEEE Conference on Computational Complexity, 2010, pp. 16-27, full version can be obtained as ECCC TR10-107.
7. O. Meir, "Combinatorial PCPs with efficient verifiers," in FOCS, 2009, full version is available as ECCC TR11-104.
8. E. Ben-Sasson and M. Sudan, "Short PCPs with polylog query complexity," SIAM J. Comput., vol. 38, no. 2, pp. 551-607, 2008, preliminary version in STOC 2005.
9. O. Meir, "IP = PSPACE using error correcting codes," Electronic Colloquium on Computational Complexity (ECCC), no. 137, 2010.
10. E. Ben-Sasson, O. Goldreich, P. Harsha, M. Sudan, and S. Vadhan, "Robust PCPs of proximity, shorter PCPs and applications to coding," SIAM Journal of Computing, vol. 36, no. 4, pp. 120-134, 2006.
11. E. Ben-Sasson, P. Harsha, O. Lachish, and A. Matsliah, "Sound 3-query PCPPs are long," TOCT, vol. 1, no. 2, 2009.
12. E. Ben-Sasson and M. Sudan, "Robust locally testable codes and products of codes," Random Struct. Algorithms, vol. 28, no. 4, pp. 387-402, 2006, preliminary version in APPROXRANDOM 2004.
13. F. T. Leighton, Introduction to parallel algorithms and architectures: array, trees, hypercubes. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1992.
14. L. G. Valiant, "Graph-theoretic arguments in low-level complexity," in MFCS, 1977, pp. 162-176.
15. O. Goldreich and M. Sudan, "Locally testable codes and PCPs of almost linear length," Journal of ACM, vol. 53, no. 4, pp. 558-655, 2006, preliminary version in FOCS 2002, pages 13-22.
16. M. Sudan, "Algorithmic introduction to coding theory (lecture notes)," 2001, available from http://theory.csail.mit.edu/~madhu/FT01/.
17. I. Dinur, M. Sudan, and A. Wigderson, "Robust local testability of tensor products of ldpc codes," in APPROX-RANDOM, 2006, pp. 304-315.
18. E. Ben-Sasson and M. Viderman, "Tensor products of weakly smooth codes are robust," Theory of Computing, vol. 5, no. 1, pp. 239-255, 2009.
19. -, "Composition of semi-ltcs by two-wise tensor products," in APPROX-RANDOM, 2009, pp. 378-391.
20. C. H. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," J. Comput. Syst. Sci., vol. 43, no. 3, pp. 425-440, 1991.
21. L. Babai, L. Fortnow, L. A. Levin, and M. Szegedy, "Checking computations in polylogarithmic time," in STOC, 1991, pp. 21-31.
22. A. Polishchuk and D. A. Spielman, "Nearly-linear size holographic proofs," in STOC, 1994, pp. 194-203.