Constant rate PCPs for circuit-SAT with sublinear query complexity

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2013, Pages 320-329

  Ben Sasson, Eli ^a   Kaplan, Yohay ^a   Kopparty, Swastik ^b   Meir, Or ^c   Stichtenoth, Henning ^d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

^d SABANCI UNIVERSITY   (Turkey)

Author keywords

AG codes; Computational complexity; Probabilistically checkable proofs

Indexed keywords

AFFINE TRANSFORMATIONS; ALGEBRAIC GEOMETRY CODE; AUTOMORPHISMS; CONSTANT RATE; MESSAGE LENGTH; PROBABILISTICALLY CHECKABLE PROOF; QUERY COMPLEXITY; SUB-LINEAR QUERIES;

ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; ENCODING (SYMBOLS);

QUERY PROCESSING;

EID: 84893487589     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2013.42     Document Type: Conference Paper

References (46)

1. [ALM+98] Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan, and Mario Szegedy, Proof verification and intractability of approximation problems, Journal of ACM 45 (1998), no. 3, 501-555.
2. [Alo99] Noga Alon, Combinatorial nullstellensatz, Combinatorics Probability and Computing 8 (1999), no. 1, 7-30.
3. [Aro02] Sanjeev Arora, How NP got a new definition: A survey of probabilistically checkable proofs, ICM '02: Proceedings of the 2002 International Congress of Mathematicians, vol. 3, 2002, pp. 637-648.
4. [AS98] Sanjeev Arora and Shmuel Safra, Probabilistic checkable proofs: A new characterization of NP, Journal of ACM volume 45 (1998), no. 1, 70-122.
5. [BCGT13a] Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, and Eran Tromer, Fast reductions from RAMs to delegatable succinct constraint satisfaction problems, ITCS 2013.
6. [BCGT13b] Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, and Eran Tromer, On the concrete efficiency of probabilistically-checkable proofs, STOC 2013.
7. [BFLS91] László Babai, Lance Fortnow, Leonid A. Levin, and Mario Szegedy, Checking computations in polylogarithmic time, STOC, 1991, pp. 21-31.
8. [BGH+05] Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, and Salil Vadhan, Short PCPs verifiable in polylogarithmic time, Proceedings of CCC, IEEE Computer Society, 2005, pp. 120-134.
9. [BGH+06] Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, and Salil Vadhan, Robust PCPs of proximity, shorter PCPs and applications to coding, SIAM Journal of Computing 36 (2006), no. 4, 120-134.
10. [BS06] Eli Ben-Sasson and Madhu Sudan, Robust locally testable codes and products of codes, Random Struct. Algorithms 28 (2006), no. 4, 387-402.
11. [BS08] Eli Ben-Sasson and Madhu Sudan, Short PCPs with polylog query complexity, SIAM J. Comput. 38 (2008), no. 2, 551-607.
12. [BSGK+13] Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, and Shubhangi Saraf, A new family of locally correctable codes based on degree-lifted algebraic geometry codes, STOC, 2013.
13. [BSV09] Eli Ben-Sasson and Michael Viderman, Tensor products of weakly smooth codes are robust, Theory of Computing 5 (2009), no. 1, 239-255.
14. [BSVW03] Eli Ben-Sasson, Madhu Sudan, Salil Vadhan, and Avi Wigderson, Randomness-efficient low degree tests and short pcps via epsilon-biased sets, Proceedings of STOC '03, 2003, pp. 612-621.
15. [BV09] Eli Ben-Sasson and Michael Viderman, Composition of semi-ltcs by two-wise tensor products, APPROXRANDOM 2009.
16. [Cam98] Peter J. Cameron, Combinatorics: Topics, techniques, algorithms, Cambridge University Press, Cambridge CB2 2RU, MA, USA, 1998.
17. [CR05] Don Coppersmith and Atri Rudra, On the robust testability of tensor products of codes, (ECCC) (2005), no. 104.
18. [Din07] Irit Dinur, The PCP theorem by gap amplification, Journal of ACM 54 (2007), no. 3, 241-250.
19. [DM11] Irit Dinur and Or Meir, Derandomized parallel repetition via structured PCPs, Computational Complexity 20 (2011), no. 2, 207-327.
20. [DR06] Irit Dinur and Omer Reingold, Assignment testers: Towards combinatorial proof of the PCP theorem, SIAM Journal of Computing 36 (2006), no. 4, 155-164.
21. [DSW06] Irit Dinur, Madhu Sudan, and Avi Wigderson, Robust local testability of tensor products of ldpc codes, APPROX-RANDOM, 2006, pp. 304-315.
22. [GM12] Oded Goldreich and Or Meir, The tensor product of two good codes is not necessarily locally testable, Inf. Proces. Lett. 112 (2012), no. 8-9, 351-355.
23. [GO05] Venkatesan Guruswami and Ryan O'Donnell, The PCP theorem and hardness of approximation, 2005, Available online at http://www.cs.washington. edu/education/courses/533/05au/.
24. [GS96] Arnaldo Garcia and Henning Stichtenoth, On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields, Journal of Number Theory 61 (1996), 248-273.
25. [GS06] Oded Goldreich and Madhu Sudan, Locally testable codes and pcps of almost-linear length, J. ACM 53 (2006), no. 4, 558-655.
26. [GV87] Arnaldo Garcia and JF Voloch, Wronskians and linear independence in fields of prime characteristic, manuscripta mathematica 59 (1987), no. 4, 457-469.
27. [HS00] Prahladh Harsha and Madhu Sudan, Small PCPs with low query complexity, Computational Complexity 9 (2000), no. 3-4, 157-201.
28. [KR12] Géza Kós and Lajos Rónyai, Alon's nullstellensatz for multisets, Combinatorica 32 (2012), no. 5, 589-605.
29. [KS08] Tali Kaufman and Madhu Sudan, Algebraic property testing: The role of invariance, STOC (Cynthia Dwork, ed.), ACM, 2008, pp. 403-412.
30. [KSY11] Swastik Kopparty, Shubhangi Saraf, and Sergey Yekhanin, High-rate codes with sublinear-time decoding, STOC, 2011, pp. 167-176.
31. [Lei92] F. Thomson Leighton, Introduction to parallel algorithms and architectures: Array, trees, hypercubes, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1992.
32. [LFKN92] Carsten Lund, Lance Fortnow, Howard Karloff, and Nisan Noam, Algebraic methods for interactive proof systems, Journal of the ACM 39 (1992), no. 4, 859-868.
33. [Mei10] Or Meir, IP = PSPACE using error correcting codes, (ECCC) (2010), no. 137.
34. [Mei12a] Or Meir, Combinatorial PCPs with short proofs, CCC 2012, pp. 345-355.
35. [Mei12b] Or Meir, On the rectangle method in proofs of robustness of tensor products, Inf. Process. Lett. 112 (2012), no. 6, 257-260.
36. [Mie09] Thilo Mie, Short PCPPs verifiable in polylogarithmic time with o(1) queries, Annals of Mathematics and Artificial Intelligence 56 (2009), 313-338.
37. [MS88] Florence Jessie MacWilliams and Neil James Alexander Sloane, The theory of error correcting codes, Elsevier/North-Holland, Amsterdam, 1988.
38. [PF79] Nicholas Pippenger and Michael J. Fischer, Relations among complexity measures, J. ACM 26 (1979), no. 2, 361-381.
39. [PS94] Alexander Polishchuk and Daniel A. Spielman, Nearly-linear size holographic proofs, STOC, 1994, pp. 194-203.
40. [Sti93] Henning Stichtenoth, Algebraic function fields and codes, Universitext, Springer, 1993.
41. [Sti06] Henning Stichtenoth, Transitive and self-dual codes attaining the Tsfasman-Vlǎdut,-Zink bound, IEEE Transactions on Information Theory 52 (2006), no. 5, 2218- 2224.
42. [Sud01] Madhu Sudan, Algorithmic introduction to coding theory (lecture notes), 2001.
43. [Sud10] Madhu Sudan, Invariance in property testing, Property Testing (Oded Goldreich, ed.), Lecture Notes in Computer Science, vol. 6390, Springer, 2010, pp. 211- 227.
44. [TVZ82] M.A. Tsfasman, S.G. Vladut, and T. Zink, Modular curves, shimura curves, and goppa codes, better than varshamov-gilbert bound, math. Nachr. 109 (1982), 21- 28.
45. [Val05] Paul Valiant, The tensor product of two codes is not necessarily robustly testable, APPROX-RANDOM, 2005, pp. 472-481.
46. [Vid12] Michael Viderman, A combination of testability and decodability by tensor products, APPROX-RANDOM, 2012, pp. 651-662.