Locally testable codes and PCPs of almost-linear length

Journal of the ACM

Volumn 53, Issue 4, 2006, Pages 558-655

  Goldreich, Oded ^a   Sudan, Madhu ^b,c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Derandomization; Error correcting codes; Probabilistically checkable proofs; Proof verification

Indexed keywords

DERANDOMIZATION; ERROR CORRECTING CODES; PROBABILISTICALLY CHECKABLE PROOFS; PROOF VERIFICATION;

BINARY CODES; COMBINATORIAL MATHEMATICS; ERROR CORRECTION; QUADRATIC PROGRAMMING;

MEMBERSHIP FUNCTIONS;

EID: 33748921409     PISSN: 00045411     EISSN: 00045411     Source Type: Journal    
DOI: 10.1145/1162349.1162351     Document Type: Article

References (32)

1. ALON, N., KAUFMAN, T., KRIVELEVICH, M., LITSYN, S., AND RON, D. 2003. Testing low-degree polynomials over GF(2). In Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 2003). Lecture Notes in Computer Science, vol. 2754, Springer, New York, 188-199.
2. ARORA, S., LUND, C., MOTWANI, R., SUDAN M., AND SZEGEDY, M. 1998. Proof verification and the hardness of of approximation problems. J. ACM, 45, 3 (May), 501-555.
3. ARORA, S., AND SAFRA, S. 1998. Probabilistic checkable proofs: A new characterization of NP. J. ACM 45, 1 (Jan.), 70-122.
4. ARORA, S., AND SUDAN, M. 2003. Improved low degree testing and its applications. Combinatorica 23, 3, 365-426
5. BABAI, L., FORTNOW, L., LEVIN, L., AND SZEGEDY, M. 1991a. Checking computations in polylogarithmic time. In Proceedings of the 23rd ACM Symposium on the Theory of Computing. ACM, New York, 21-31.
6. BABAI, L., FORTNOW, L., AND LUND. C. 1991b. Non-deterministic exponential time has two-prover interactive protocols. Comput. Complex. 1, 13-40.
7. BELLARE, M., COPPERSMITH, D., HÅSTAD, J., KIWI, M., AND SUDAN, M. 1996. Linearity testing over characteristic two. IEEE Trans. Info. Theory 42, 6 (Nov.), 1781-1795.
8. BELLARE, M. GOLDREICH, O., AND SUDAN, M. 1998. Free bits, PCPs, and nonapproximability - towards tight results. SIAM J. Comput. 27, 3, 804-915.
9. BELLARE, M., GOLDWASSER, S., LUND, C., AND RUSSELL, A. 1993. Efficient probabilistically checkable proofs and applications to approximation. In Proceedings of the 25th ACM Symposium on the Theory of Computing ACM, New York, 294-304.
10. BEN-SASSON, E., GOLDREICH, O., HARSHA, P., SUDAN, M., AND VADHAN, S. 2004. Robust PCPs of proximity, shorter PCPs and applications to coding. In Proceedings of the 36th ACM Symposium on the Theory of Computing ACM, New York, 1-10.
11. BEN-SASSON, E., GOLDREICH, O., AND SUDAN, M. 2003a. Bounds on 2-query codeword testing. In Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM 2003). Lecture Notes in Computer Science, Vol. 2764. Springer, New York, 216-227.
12. BEN-SASSON, E., AND SUDAN, M. 2005. Short PCPs with poly-log rate and query complexity. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing. ACM, New York, 266-275.
13. BEN-SASSON, E., SUDAN, M. VADHAN, S., AND WIGDERSON, A. 2003b. Randomness-efficient low degree tests and short PCPs via ∈ biased sets. In Proceedings of the 35th ACM Symposium on the Theory of Computing. ACM, New York, 612-621.
14. BLUM, M., LUBY, M., AND RUBINFELD, R. 1993. Self-testing/correcting with applications to numerical problems. J. Comput. Syst. Sci. 47, 3, 549-595.
15. CREIGNOU, N., KHANNA, S., AND SUDAN, M. 2001. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Press, Philadeplhia, PA.
16. DINUR, I. 2006. The PCP theorem by gap amplification. In Proceedings of the 38th ACM Symposium on the Theory of Computing. ACM, New York, 241-250.
17. DINUR, I., AND REINGOLD, O. 2004. Assignment-testers: Towards a combinatorial proof of the PCP-theorem. In Proceedings of the 45th Annual IEEE Symposium on on Foundations of Computer Science. IEEE. Computer Society Press, Los Alamitos, CA, 155-164.
18. EVEN, S., SELMAN, A. L., AND YACOBI, Y. 1984. The complexity of promise problems with applications to public-key cryptography. Info. Control 61, 2 (May), 159-173.
19. FEIGE, U., GOLDWASSER, S. LOVÁSZ, L., SAFRA, S., AND SZEGEDY, M. 1996. Interactive proofs and the hardness of approximating cliques. J. ACM, 43, 268-292.
20. FORNEY, JR., G. D. 1966. Concatenated Codes. MIT Press, Cambridge, MA.
21. FRIEDL, K., AND SUDAN, M. 1995. Some improvements to low-degree tests. In Proceedings of the 3rd Annual Israel Symposium on Theory and Computing Systems, (Washington, DC).
22. GOLDREICH, O., GOLDWASSER, S., AND D. RON. 1998. Property testing and its connection to learning and approximation. J. ACM, 653-750.
23. GOLDREICH, O, KARLOFF, H., SCHULMAN, L. J., AND TREVISAN, L. 2002. Lower bounds for linear locally decodable codes and private information retrieval. In the Proceedings of the 17th IEEE Conference on Computational Complexity. IEEE, Computer Society Press, Los Alamitos, CA, 175-183.
24. GOLDREICH, O., AND SUDAN, M. 2002. Locally testable codes and PCPs of almost-linear length tech. Rep. TR02-050, ECCC.
25. HARSHA, P., AND SUDAN. M. 2000. Small PCPs with low query complexity. Computat. Complex. 9, (3-4), 157-201.
26. 1-∈. Acta Math. 182, 105-142.
27. KATZ, J., AND TREVISAN, L. 2000. On the efficiency of local decoding procedures for error-correcting codes. In STOC'00: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing. ACM, New York, 80-86.
28. KIWI, M. 2003. Algebraic testing and weight distribution of dual codes. TR97-010.
29. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press.
30. POLISHCHUK, A., AND SPIELMAN, D. A. 1994. Nearly-linear size holographic proofs. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, ACM, New York, 194-203.
31. RAZ, R., AND SAFRA, S. 1997. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing. ACM, New York, 475-484.
32. RUBINFELD, R., AND SUDAN, M. 1996. Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25, (2) (Apr.), 252-271.