Robust PCPs of proximity, shorter PCPs and applications to coding

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 1-10

  Ben Sasson, Eli ^a   Goldreich, Oded ^b   Harsha, Prahladh ^c   Sudan, Madhu ^c   Vadhan, Salil ^d  

^a HARVARD UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d HARVARD UNIVERSITY   (United States)

Author keywords

Locally Decodable Codes; Locally Testable Codes; PCP; Probabilistically Checkable Proofs; Property Testing

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; ENCODING (SYMBOLS); HOLOGRAPHY; INFORMATION THEORY; NETWORKS (CIRCUITS); OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

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

COMPUTATIONAL COMPLEXITY;

EID: 4544310411     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007361     Document Type: Conference Paper

References (27)

1. ARORA, S., LUND, C., MOTWANI, R., SUDAN, M., AND SZEGEDY, M. Proof verification and the hardness of approximation problems. Journal of the ACM 45, 3 (May 1998), 501-555. (Preliminary Version in 33rd FOCS, 1992).
2. ARORA, S., AND SAFRA, S. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45, 1 (Jan. 1998), 70-122. (Preliminary Version in 33rd FOCS, 1992).
3. BABAI, L., FORTNOW, L., LEVIN, L. A., AND SZEGEDY, M. Checking computations in polylogarithmic time. In Proc. 23rd ACM Symp. on Theory of Computing (New Orleans, Louisiana, 6-8 May 1991), pp. 21-31.
4. BELLARE, M., GOLDREICH, O., AND SUDAN, M. Free bits, PCPs, and nonapproximability - towards tight results. SIAM Journal of Computing 27, 3 (June 1998), 804-915. (Preliminary Version in 36th FOCS, 1995).
5. BELLARE, M., GOLDWASSER, S., LUND, C., AND RUSSELL, A. Efficient probabilistically checkable proofs and applications to approximation. In Proc. 25th ACM Symp. on Theory of Computing (San Diego, California, 16-18 May 1993), pp. 294-304.
6. BEN-SASSON, E., GOLDREICH, O., HARSHA, P., SUDAN, M., AND VADHAN, S. Robust PCPs of proximity, Shorter PCPs and Applications to Coding. Technical Report (to be posted in ECCC).
7. BEN-SASSON, E., HARSHA, P., AND RASKHODNIKOVA, S. Some 3CNF properties are hard to test. In Proc. 35th ACM Symp. on Theory of Computing (San Diego, California, 9-11 June 2003), pp. 345-354.
8. BEN-SASSON, E., SUDAN, M., VADHAN, S., AND WIGDERSON, A. Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. In Proc. 35th ACM Symp. on Theory of Computing (San Diego, California, 9-11 June 2003), pp. 612-621.
9. BOGDANOV, A., OBATA, K., AND TREVISAN, L. A lower bound for testing 3-colorability in bounded-degree graphs. In Proc. 43rd IEEE Symp. on Foundations of Comp. Science (Vancouver, Canada, 16-19 Nov. 2002), pp. 93-102.
10. BOGDANOV, A., AND TREVISAN, L. Lower bounds for testing bipartiteness in dense graphs. Tech. Rep. TR02-064, Electronic Colloquium on Computational Complexity, 2002.
11. DINUR, I., AND REINGOLD, O. PCP testers: Towards a more combinatorial proof of PCP theorem. (In Preparation), 2003.
12. ERGÜN, F., KUMAR, R., AND RUBINFELD, R. Fast approximate PCPs. In Proc. 31st ACM Symp. on Theory of Computing (Atlanta, Georgia, 1-4 May 1999), pp. 41-50.
13. FEIGE, U., GOLDWASSER, S., LOVÁSZ, L., SAFRA, S., AND SZEGEDY, M. Interactive proofs and the hardness of approximating cliques. Journal of the ACM 43, 2 (Mar. 1996), 268-292. (Preliminary version in 32nd FOCS, 1991).
14. FORTNOW, L., ROMPEL, J., AND SIPSER, M. On the power of multi-prover interactive protocols. Theoretical Computer Science 134, 2 (Nov. 1994), 545-557. (Preliminary Version in 3rd IEEE Symp. on Structural Complexity, 1988).
15. GOLDREICH, O., GOLDWASSER, S., AND RON, D. Property testing and its connection to learning and approximation. Journal of the ACM 45, 4 (July 1998), 653-750. (Preliminary Version in 37th FOCS, 1996).
16. GOLDREICH, O., AND RON, D. Property testing in bounded degree graphs. Algorithmica 32, 2 (Jan. 2002), 302-343. (Preliminary Version in 29th STOC, 1997).
17. GOLDREICH, O., AND SAFRA, S. A combinatorial consistency lemma with application to proving the PCP theorem. SIAM Journal of Computing 29, 4 (2000), 1132-1154. (Preliminary Version in RANDOM, 1997).
18. GOLDREICH, O., AND SUDAN, M. Locally testable codes and PCPs of almost linear length. In Proc. 43rd IEEE Symp. on Foundations of Comp. Science (Vancouver, Canada, 16-19 Nov. 2002), pp. 13-22. (See ECC Report TR02-050, 2002).
19. GURUSWAMI, V., LEWIN, D., SUDAN, M., AND TREVISAN, L. A tight characterization of NP with 3-query PCPs. In Proc. 39th IEEE Symp. on Foundations of Comp. Science (Palo Alto, California, 8-11 Nov. 1998), pp. 18-27.
20. HARSHA, P., AND SUDAN, M. Small PCPs with low query complexity. Computational Complexity 9, 3-4 (Dec. 2000), 157-201. (Preliminary Version in 18th STACS, 2001).
21. HÅSTAD, J. Some optimal inapproximability results. Journal of the ACM 48, 4 (July 2001), 798-859. (Preliminary Version in 29th STOC, 1997).
22. KATZ, J., AND TREVISAN, L. On the efficiency of local decoding procedures for error-correcting codes. In Proc. 32nd ACM Symp. on Theory of Computing (Portland, Oregon, 21-23 May 2000), pp. 80-86.
23. LAPIDOT, D., AND SHAMIR, A. Fully parallelized multi prover protocols for NEXP-time (extended abstract). In Proc. 32nd IEEE Symp. on Foundations of Comp. Science (San Juan, Puerto Rico, 1-4 Oct. 1991), pp. 13-18.
24. POLISHCHUK, A., AND SPIELMAN, D. A. Nearly-linear size holographic proofs. In Proc. 26th ACM Symp. on Theory of Computing (Montréal, Québec, Canada, 23-25 May 1994), pp. 194-203.
25. RAZ, R. A parallel repetition theorem. SIAM Journal of Computing 27, 3 (June 1998), 763-803. (Preliminary Version in 27th STOC, 1995).
26. RUBINFELD, R., AND SUDAN, M. Robust characterizations of polynomials with applications to program testing. SIAM Journal of Computing 25, 2 (Apr. 1996), 252-271. (Preliminary Version in 23rd STOC, 1991 and 3rd SODA, 1992).
27. SAMORODNITSKY, A., AND TREVISAN, L. A PCP characterization of NP with optimal amortized query complexity. In Proc. 32nd ACM Symp. on Theory of Computing (Portland, Oregon, 21-23 May 2000), pp. 191-199.