Robust PCPs of proximity, shorter PCPs, and applications to coding

SIAM Journal on Computing

Volumn 36, Issue 4, 2006, Pages 889-974

  Ben Sasson, E L I ^a   Goldreich, Oded ^b   Harsha, Prahladh ^c   Sudan, Madhu ^d   Vadhan, Salil ^e  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^e HARVARD UNIVERSITY   (United States)

Author keywords

Locally decodable codes; Locally testable codes; PCP; Probabilistically checkable proofs; Property testing

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; PROBABILISTIC LOGICS; QUERY PROCESSING; ROBUST CONTROL;

BOOLEAN QUERIES; LOCALLY DECODABLE CODES; LOCALLY TESTABLE CODES; PROBABILISTICALLY CHECKABLE PROOFS; PROPERTY TESTING;

ENCODING (SYMBOLS);

EID: 34547829716     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539705446810     Document Type: Article

References (56)

1. N. ALON, O. GOLDREICH, J. HÅSTAD, AND R. PERALTA, Simple constructions of almost k-wise independent random variables, Random Structures Algorithms, 3 (1992), pp. 289-304.
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. (Preliminary version in Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, 1992, pp. 14-23.)
3. S. ARORA AND S. SAFRA, Probabilistic checking of proofs: A new characterization of NP, J. ACM, 45 (1998), pp. 70-122. (Preliminary version in Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science, 1992, pp. 2-13.)
4. L. BABAI, L. FORTNOW, L. A. LEVIN, AND M. SZEGEDY, Checking computations in polylogarithmic time, in Proceedings of the 23rd ACM Symposium on Theory of Computing, New Orleans, LA, 1991, pp. 21-31.
5. B. BARAK, How to go beyond the black-box simulation barrier, in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, Las Vegas, NV, 2001, pp. 106-115.
6. 1/(2k-1)) barrier for information-theoretic private information retrieval, in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, Vancouver, BC, Canada, 2002, pp. 261-270.
7. M. BELLARE, O. GOLDREICH, AND M. SUDAN, Free bits, PCPs, and nonapproximability-towards tight results, SIAM J. Comput., 27 (1998), pp. 804-915. (Preliminary version in Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, 1995, pp. 422-431.)
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, San Diego, CA, 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, Chicago, IL, 2004, pp. 1-10.
10. E. BEN-SASSON, O. GOLDREICH, P. HARSHA, M. SUDAN, AND S. VADHAN, Robust PCPs of Proximity, Shorter PCPs and Applications to Coding, Tech. report TR04-021, Electronic Colloquium on Computational Complexity, 2004. Available online at http://eccc.hpi-web.de/eccc-reports/2004/TR04-021/index.html
11. 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.
12. E. BEN-SASSON, P. HARSHA, AND S. RASKHODNIKOVA, Some 3CNF properties are hard to test, SIAM J. Comput., 35 (2005), pp. 1-21. (Preliminary version in Proceedings of the 35th ACM Symposium on Theory of Computing, 2003, pp. 345-354.)
13. E. BEN-SASSON AND M. SUDAN, Simple PCPs with poly-log rate and query complexity, in Proceedings of the 37th ACM Symposium on Theory of Computing, Baltimore, MD, 2005, pp. 266-275.
14. 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, San Diego, CA, 2003, pp. 612-621.
15. M. BLUM, M. LUBY, AND R. RUBINFELD, Self-testing/correcting with applications to numerical problems, J. Comput. System Sci., 47 (1993), pp. 549-595. (Preliminary version in Proceedings of the 22nd ACM Symposium on Theory of Computing, 1990, pp. 73-83.)
16. A. BOGDANOV, K. OBATA, AND L. TREVISAN, A lower bound for testing 3-colorability in bounded-degree graphs, in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, Vancouver, Canada, 2002, pp. 93-102.
17. A. BOGDANOV AND L. TREVISAN, Lower bounds for testing bipartiteness in dense graphs, in Proceedings of the 19th IEEE Conference on Computational Complexity, Amherst, MA, 2004, pp. 75-81.
18. H. BUHRMAN AND R. DE WOLF, On Relaxed Locally Decodable Codes, manuscript, 2004.
19. R. CANETTI, O. GOLDREICH, AND S. HALEVI, The random oracle methodology, revisited, J. ACM, 51 (2004), pp. 557-594. (Preliminary version in Proceedings of the 30th ACM Symposium on Theory of Computing, 1998, pp. 209-218.)
20. S. A. COOK, Short propositional formulas represent nondeterministic computations, Inform. Process. Lett., 26 (1988), pp. 269-270.
21. A. DESHPANDE, R. JAIN, T. KAVITHA, S. V. LOKAM, AND J. RADHAKRISHNAN, Lower bounds for adaptive locally decodable codes, Random Structures Algorithms, 27 (2005), pp. 358-378. (Preliminary version in Proceedings of the 17th IEEE Conference on Computational Complexity, 2002, pp. 152-161.)
22. I. DINUR, The PCP theorem by gap amplification, in Proceedings of the 38th ACM Symposium on Theory of Computing, Seattle, WA, 2006, pp. 241-250.
23. I. DINUR AND O. REINGOLD, Assignment-testers: Towards a combinatorial proof of the PCP-theorem, in Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, Rome, Italy, 2004, pp. 155-164.
24. F. ERGÜN, R. KUMAR, AND R. RUBINFELD, Fast approximate probabilistically checkable proofs, Inform. Comput., 189 (2004), pp. 135-159. (Preliminary version in Proceedings of the 31st ACM Symposium on Theory of Computing, 1999, pp. 41-50.)
25. 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. (Preliminary version in Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, 1991, pp. 2-12.)
26. L. FORTNOW, J. ROMPEL, AND M. SIPSER, On the power of multi-prover interactive protocols, Theoret. Comput. Sci., 134 (1994), pp. 545-557. (Preliminary version in Proceedings of the 3rd IEEE Symposium on Structure in Complexity Theory, 1988, pp. 156-161)
27. O. GOLDREICH, A Sample of Samplers-A Computational Perspective on Sampling, Tech. report TR97-020, Electronic Colloquium on Computational Complexity, 1997. Available online at http://www.eccc.uni-trier. de/eccc-reports/1997/TR97-020.
28. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750. (Preliminary version in Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996, pp. 339-348.)
29. O. GOLDREICH AND D. RON, Property testing in bounded degree graphs, Algorithmica, 32 (2002), pp. 302-343. (Preliminary version in Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 416-415.)
30. O. GOLDREICH AND S. SAFRA, A combinatorial consistency lemma with application to proving the PCP theorem, SIAM J. Comput., 29 (2000), pp. 1132-1154. (Preliminary version in RANDOM, Lecture Notes in Comput. Sei. 1269, Springer, Berlin, 1997, pp. 67-84.)
31. O. GOLDREICH AND M. SUDAN, Locally testable codes and PCPs of almostlinear length, in Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, Vancouver, Canada, 2002, pp. 13-22. Available online at http://www.wisdom.weizmann.ac.il/~oded/p_ltc.html.
32. 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. (Preliminary version in Proceedings of the 26th ACM Symposium on Theory of Computing, 1994, pp. 574-584.)
33. 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, Palo Alto, CA, 1998, pp. 18-27.
34. P. HARSHA AND M. SUDAN, Small PCPs with low query complexity, Comput. Complex., 9 (2000), pp. 157-201. (Preliminary version in 18th STACS, Lecture Notes in Comput. Sci. 2010, Springer, Berlin, 2001, pp. 327-338.)
35. J. HÅSTAD, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859. (Preliminary version in Proceedings of the 29th ACM Symposium on Theory of Computing, 1997, pp. 1-10.)
36. F. C. HENNIE AND R. E. STEARNS, Two-tape simulation of multitape Turing machines, J. ACM, 13 (1966), pp. 533-546.
37. J. KATZ AND L. TREVISAN, On the efficiency of local decoding procedures for errorcorrecting codes, in Proceedings of the 32nd ACM Symposium on Theory of Computing, Portland, OR, 2000, pp. 80-86.
38. I. KERENIDIS AND R. DE WOLF, Exponential lower bound for 2-query locally decodable codes via a quantum argument, J. Comput. System Sci., 69 (2004), pp. 395-420. (Preliminary version in Proceedings of the 35th ACM Symposium on Theory of Computing, 2003, pp. 106-115.)
39. J. KILIAN, A note on efficient zero-knowledge proofs and arguments (extended abstract), in Proceedings of the 24th ACM Symposium on Theory of Computing, Victoria, BC, Canada, 1992, pp. 723-732.
40. D. LAPIDOT AND A. SHAMIR, Fully parallelized multi prover protocols for NEXPtime, J. Comput. System Sci., 54 (1997), pp. 215-220. (Preliminary version in Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, 1991, pp. 13-18.)
41. F. T. LEIGHTON, Introduction to Parallel Algorithms and Architectures, Morgan Kaufmann Publishers, Inc., San Mateo, CA, 1992.
42. C. LUND, L. FORTNOW, H. KARLOFF, AND N. NISAN, Algebraic methods for interactive proof systems, J. ACM, 39 (1992), pp. 859-868. (Preliminary version in Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, 1990, pp. 2-10.)
43. S. MICALI, Computationally sound proofs, SIAM J. Comput., 30 (2000), pp. 1253-1298. (Preliminary version in Proceedings of the 35th IEEE Symposium on Foundations of Computer Science, 1994, pp. 436-453.)
44. D. MOSHKOVITZ AND R. RAZ, Sub-constant error low degree test of almost linear size, in Proceedings of the 38th ACM Symposium on Theory of Computing, Seattle, WA, 2006, pp. 21-30.
45. J. NAOR AND M. NAOR, Small-bias probability spaces: Efficient constructions and applications, SIAM J. Comput., 22 (1993), pp. 838-856. (Preliminary version in Proceedings of the 22nd ACM Symposium on Theory of Computing, 1999, pp. 213-233.)
46. N. PIPPENGER AND M. J. FISCHER, Relations among complexity measures, J. ACM, 26 (1979), pp. 361-381.
47. A. POLISHCHUK AND D. A. SPIELMAN, Nearly-linear size holographic proofs, in Proceedings of the 26th ACM Symposium on Theory of Computing, Montréal, Québec, Canada, 1994, pp. 194-203.
48. R. RAZ, A parallel repetition theorem, SIAM J. Comput., 27 (1998), pp. 763-803. (Preliminary version in Proceedings of the 27th ACM Symposium on Theory of Computing, 1995, pp. 447-556.)
49. R. RUBINFELD AND M. SUDAN, Robust characterizations of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271. (Preliminary versions in Proceedings of the 23rd ACM Symposium on Theory of Computing, 1991, pp. 33-42 and Proceedings of the 3rd ACM-SIAM Symposium on Discrete Algorithms, 1992, pp. 23-43.)
50. 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, Portland, OR, 2000, pp. 191-199.
51. A. SCHÖNHAGE, Schnelle multiplikation von polynomen über Körpern der charakteristik 2 [Fast multiplication of polynomials over characteristic 2], Acta Inform., 4 (1977), pp. 395-398.
52. A. SCHÖNHAGE AND V. STRASSEN, Schnelle multiplikation großer zahlen [Fast multiplication of large numbers], Computing, 7 (1971), pp. 281-292.
53. D. A. SPIELMAN, Linear-time encodable and decodable error-correcting codes, IEEE Trans. Inform. Theory, 42 (1996), pp. 1723-1732. (Preliminary version in Proceedings of the 27th ACM Symposium on Theory of Computing, 1995, pp. 388-397.)
54. D. A. SPIELMAN, Computationally Efficient Error-Correcting Codes and Holographic Proofs, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, June 1995.
55. V. SRASSEN, Vermeidung von Divisionen [Avoiding divisions], J. Reine Angew. Math., 264 (1973), pp. 184-202.
56. M. SZEGEDY, Many-valued logics and holographic proofs, in Proceedings of the 26th International Colloquium of Automata, Languages, and Programming (ICALP '99), J. Wiedermann, P. van Emde Boas, and M. Nielsen, eds., Lecture Notes in Comput. Sci. 1644, Springer-Verlag, Berlin, pp. 676-686.