Short PCPs verifiable in polylogarithmic time

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2005, Pages 120-134

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

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d MICROSOFT RESEARCH   (United States)

^e MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^f HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY CONSTRAINTS; CONSTRAINT SATISFACTION PROBLEM; POLYLOGARITHMIC TIME; QUERY COMPLEXITY;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBABILISTIC LOGICS; PROBLEM SOLVING;

FORMAL LANGUAGES;

EID: 27644561824     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. [AS98] 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).
2. [BFLS91] 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.
3. [BG02] BARAK, B. AND GOLDREICH, O. Universal Arguments and their Applications. In Proc. 17th IEEE Conference on Computational Complexity (Montréal, Québec, Canada, 21-24 May 2002), pp. 75-81.
4. [BGH+04] BEN-SASSON, E., GOLDREICH, O., HARSHA, P., SUDAN, M., AND VADHAN, S. Robust PCPs of proximity, shorter PCPs and applications to coding. In Proc. 36th ACM Symp. on Theory of Computing (Chicago, Illinois, 13-15 June 2004), pp. 1-10.
5. [BGH+05] BEN-SASSON, E., GOLDREICH, O., HARSHA, P., SUDAN, M., AND VADHAN, S. Short PCPs verifiable in polylogarithmic time. (To be posted in ECCC.)
6. [BS05] BEN-SASSON, E., AND SUDAN, M. Simple PCPs with polylog rate and query complexity. To appear in Proc. 37th ACM Symp. on Theory of Computing, Baltimore, Maryland, 21-24 May 2005.
7. [BSVW03] 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.
8. [DR04] DINUR, I., AND REINGOLD, O. Assignment-testers: Towards a combinatorial proof of the PCP-Theorem. In Proc. 45rd IEEE Symp. on Foundations of Comp. Science (Rome, Italy, 17-19 Oct. 2004), pp. 155-164.
9. [EKR99] 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.
10. +96) 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, 1 (Mar. 1996), 268-292. (Preliminary version in 32nd FOCS, 1991).
11. [GGR98] 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).
12. [GS02] GOLDREICH, O., AND SUDAN, M. Locally testable codes and PCPs of almost linear length. In Proc. 43nd IEEE Symp. on Foundations of Comp. Science (Vancouver, Canada, 16-19 Nov. 2002), pp. 13-22.
13. (See ECCC Report TR02-050, 2002).
14. [HS00] HARSHA, P., AND SUDAN, M. Small PCPs with low query complexity. Computational Complexity 9, 3-4 (Dec. 2000), 157-201. (Preliminary Version in 18th STAGS, 2001).
15. [Kil92] KILIAN, J. A note on efficient zero-knowledge proofs and arguments (extended abstract). In Proc. 24th ACM Symp. on Theory of Computing (Victoria, British Columbia, Canada, 4-6 May 1992), pp. 723-732.
16. [LN94] LIDL, R., AND NIEDERREITER, H. Introduction to Finite Fields and their applications. Cambridge University Press, Cambdridge, United Kingdom, 1994.
17. [Mic00] MICALI, S. Computationally sound proofs. SIAM Journal of Computing 30, 4 (2000), 1253-1298. (Preliminary Version in 35th FOCS, 1994).
18. [PF79] PIPPENGER, N., AND FISCHER, M. J. Relations among complexity measures. Journal of the ACM 86, 2 (Apr. 1979), 361-381.
19. [PS94] 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.
20. [RS96] 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).
21. [VL88] VENKATESAN, R., AND LEVIN L.A. Random Instances of a Graph Coloring Problem are Hard. In Proc. 20th ACM Symp. on Theory of Computing, (White Plains, New York, 24-26 Oct 1988), pp 217-222.