Short PCPS with polylog query complexity

SIAM Journal on Computing

Volumn 38, Issue 2, 2008, Pages 551-607

  Eli, Ben Sasson ^a   Sudan, Madhu ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Locally testable codes; PCPs of proximity; Probabilistically checkable proofs (PCPs); Reed Solomon codes

Indexed keywords

ANALOGOUS CONSTRUCTIONS; CODE WORDS; INFORMATION BITS; LOCALLY TESTABLE CODES; LOGARITHMIC TIMES; NEW TECHNIQUES; NEW YORK; PCPS OF PROXIMITY; PROBABILISTICALLY CHECKABLE PROOFS; PROBABILISTICALLY CHECKABLE PROOFS (PCPS); QUERY COMPLEXITIES; SATISFIABILITY; UNIVARIATE;

DECODING; KETONES; NETWORKS (CIRCUITS); POLYNOMIAL APPROXIMATION; POLYNOMIALS; PROBABILITY DENSITY FUNCTION; PROGRAMMING THEORY; REED-SOLOMON CODES;

CODES (SYMBOLS);

EID: 55249095082     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050646445     Document Type: Conference Paper

References (40)

1. N. ALON, Combinatorial Nullstellensatz, Combin. Probab. Comput., 8 (1999), pp. 7 - 29.
2. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and the hardness of approximation problems, J. ACM, 45 (1998), pp. 501 - 555.
3. S. ARORA AND S. SAFRA, Probabilistic checking of proofs: A new characterization of NP, J. ACM, 45 (1998), pp. 70-122.
4. L. BABAI, L. FORTNOW, AND C. LUND, Nondeterministic exponential time has two-prover interactive protocols, Comput. Complexity, 1 (1991), pp. 3 - 40.
5. L. BABAI, L. FORTNOW, L. LEVIN, AND M. SZEGEDY, Checking computations in polylogarithmic time, in Proceedings of the 23rd ACM Symposium on Theory of Computing, ACM, New York, 1991, pp. 21-31.
6. B. BARAK, How to go beyond the black-box simulation barrier, in Proceedings of the 42nd ACM Symposium on Theory of Computing, ACM, New York, 2001, pp. 106 - 115.
7. M. BELLARE, O. GOLDREICH, AND M. SUDAN, Free bits, PCPs, and nonapproximability - towards tight results, SIAM J. Comput., 27 (1998), pp. 804-915.
8. M. BELLARE, S. GOLDWASSER, C. LUND, AND A. RUSSELL, Efficient probabilistically checkable proofs and applications to approximation, in Proceedings of the 25th ACM Symposium on Theory of Computing, ACM, New York, 1993, pp. 294-304.
9. E. BEN-SASSON, O. GOLDREICH, P. HARSHA, M. SUDAN, AND S. VADHAN, Robust PCPs of proximity, shorter PCPs, and applications to coding, in Proceedings of the 36th ACM Symposium on Theory of Computing, ACM, New York, 2004, pp. 13 - 15.
10. E. BEN-SASSON, O. GOLDREICH, P. HARSHA, M. SUDAN, AND S. VADHAN, Short PCPs verifiable in polylogarithmic time, in Proceedings of the 20th IEEE Conference on Computational Complexity, San Jose, CA, 2005, pp. 120 - 134.
11. E. BEN-SASSON, M. SUDAN, S. VADHAN, AND A. WIGDERSON, Randomness-efficient low degree tests and short PCPs via, epsilon-biased sets, in Proceedings of the 35th ACM Symposium on Theory of Computing, ACM, New York, 2003, pp. 612-621.
12. A. BHATTACHARYYA, Implementing Probabilistically Checkable Proofs of Proximity, Technical report MIT-CSAIL-TR-2005-051 (MIT-LCS-TR-998), MIT, Cambridge, MA, 2005. Available online from http://publications.csail.mit.edu/2005trs.shtml.
13. R. CANETTI, O. GOLDREICH, AND S. HALEVI, The random oracle methodology, revisited, J. ACM, 51 (2004), pp. 557-594.
14. S. COOK, The complexity of theorem-proving procedures, in Proceedings of the 3rd IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1971, pp. 151-158.
15. S. COOK, Short propositional formulas represent nondeterministic computations, Inform. Process. Lett., 26 (1988), pp. 269-270.
16. D. Cox, J. LITTLE, AND D. O'SHEA, Ideals, Varieties, and Algorithms, Springer-Verlag, Berlin, 1992.
17. I. DINUR, E. FISCHER, G. KINDLER, R. RAZ, AND S. SAFRA, PCP characterizations of NP: Towards a polynomially-small error-probability, in Proceedings of the 31st ACM Symposium on Theory of Computing, ACM, New York, 1999, pp. 29-40.
18. I. DINUR, The PCP theorem by gap amplification, in Proceedings of the 38th ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 241-250.
19. I. DINUR AND O. REINGOLD, Assignment testers: Towards a combinatorial proof of the PCP theorem, SIAM J. Comput., 36 (2006), pp. 975-1024.
20. U. FEIGE, S. GOLDWASSER, L. LOVÁSZ, S. SAFRA, AND M. SZEGEDY, Interactive proofs and the hardness of approximating cliques, J. ACM, 43 (1996), pp. 268 - 292.
21. K. FRIEDL, Z. HÁTSÁGI, AND A. SHEN, Low-degree tests, in Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 1994, pp. 57 - 64.
22. O. GOLDREICH, A Sample of Samplers - a Computational Perspective on Sampling, Tech. rep. TR97-020, Electronic Colloquium on Computational Complexity, 1997.
23. O. GOLDREICH, Short Locally Testable Codes and Proofs (Survey), Tech. rep. TR05-014, Electronic Colloquium on Computational Complexity, 2005.
24. O. GOLDREICH AND M. SUDAN, Locally testable codes and PCPs of almost linear length (second revision), initial version appeared in Proceedings of the 43rd ACM Symposium on Theory of Computing, ACM, New York, 2002, pp. 13-22.
25. O. GOLDREICH AND A. WIGDERSON, Tiny families of functions with random properties: A quality-size trade-off for hashing, Random Structures Algorithms, 11 (1997), pp. 315 - 343.
26. V. GURUSWAMI, D. LEWIN, M. SUDAN, AND L. TREVISAN, A tight characterization of NP with 3-query PCPs, in Proceedings of the 39th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1998, pp. 18-27.
27. P. HARSHA AND M. SUDAN, Small PCPs with low query complexity, Comput. Complexity, 9 (2000), pp. 157-201.
28. J. HÅSTAD, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
29. F. C. HENNIE AND R. E. STEARNS, Two-tape simulation of multitape turing machines, J. ACM, 13 (1966), pp. 533-546.
30. J. KILIAN, A note on efficient zero-know ledge proofs and arguments (extended abstract), in Proceedings of the 24th ACM Symposium on Theory of Computing, ACM, New York, 1992, pp. 723-732.
31. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann Publishers, San Mateo, CA, 1992.
32. R. LIDL AND H. NIEDERREITER, Finite Fields, 2nd ed., Cambridge University Press, Cambridge, UK. 1997.
33. Y. LINNIK, On the least prime in an arithmetic progression. I. The basic theorem, Mat. Sb. N. S., 15 (57), 1944, pp. 139-178 (in Russian).
34. C. LUND, L. FORTNOW, H. KARLOFF, AND N. NISAN, Algebraic methods for interactive proof systems, J. ACM, 39 (1992), pp. 859-868.
35. S. MICALI, Computationally soundproofs, SIAM J. Comput., 30 (2000), pp. 1253-1298.
36. C. PAPADIMITRIOU, Computational Complexity, Addison-Wesley, Reading, MA, Longman, Harlow, UK, 1994.
37. A. POLISHCHUK AND D. SPIELMAN, Nearly-linear size holographic proofs, in Proceedings of the 26th ACM Symposium on Theory of Computing, ACM, New York, 1994, pp. 194-203.
38. A. SAMORODNITSKY AND L. TREVISAN, A PCP characterization of NP with optimal amortized query complexity, in Proceedings of the 32nd ACM Symposium on Theory of Computing, ACM, New York, 2000, pp. 191-199.
39. D. SPIELMAN, Computationally Efficient Error-Correcting Codes and Holographic Proofs, Ph.D. thesis, MIT, Cambridge, MA, 1995.
40. M. SZEGEDY, Many-valued logics and holographic proofs, in Proceedings of the 26th International Colloquium on Automata, Languages, and Programming, Prague, Czech Republic, 1999, pp. 676-686.