On sums of locally testable affine invariant properties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6845 LNCS, Issue , 2011, Pages 400-411

  Ben Sasson, Eli ^a   Grigorescu, Elena ^b   Maatouk, Ghid ^c   Shpilka, Amir ^a,d   Sudan, Madhu ^e  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c EPFL   (Switzerland)

^d MICROSOFT RESEARCH   (United Kingdom)

^e MICROSOFT RESEARCH   (United States)

Author keywords

Direct sums; Error correcting codes; Property testing; Symmetries

Indexed keywords

ABSTRACT CLASS; AFFINE INVARIANT; AFFINE TRANSFORMATIONS; DIRECT SUM; ERROR CORRECTING CODE; INTRIGUING QUESTIONS; LOCAL CONSTRAINTS; MULTIVARIATE POLYNOMIAL; PROPERTY-TESTING; SYMMETRIES; TESTABILITY;

CHARACTERIZATION; COMBINATORIAL OPTIMIZATION; OPTICS; OPTIMIZATION; ORBITS; VECTOR SPACES;

APPROXIMATION ALGORITHMS;

EID: 80052377552     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22935-0_34     Document Type: Conference Paper

References (21)

1. Alon, N., Fischer, E., Newman, I., Shapira, A.: A combinatorial characterization of the testable graph properties: it's all about regularity. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, pp. 251-260. ACM, New York (2006)
2. Alon, N., Kaufman, T., Krivelevich, M., Litsyn, S., Ron, D.: Testing Reed-Muller codes. IEEE Transactions on Information Theory 51(11), 4032-4039 (2005)
3. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. Journal of the ACM 45(3), 501-555 (1998)
4. Arora, S., Safra, S.: Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM 45(1), 70-122 (1998)
5. Barak, B., Dvir, Z., Wigderson, A., Yehudayoff, A.: Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 17, p. 149 (2010); To appear in STOC 2011
6. Barkol, O., Ishai, Y., Weinreb, E.: On locally decodable codes, self-correctable codes, and t-private PIR. Algorithmica 58, 831-859 (2010)
7. Ben-Sasson, E., Grigorescu, E., Maatouk, G., Shpilka, A., Sudan, M.: On sums of locally testable affine invariant properties. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 18, p. 79 (2011)
8. Ben-Sasson, E., Maatouk, G., Shpilka, A., Sudan, M.: Symmetric LDPC codes are not necessarily locally testable. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 17, p. 199 (2010); To appear in CCC 2011
9. Ben-Sasson, E., Sudan, M.: Limits on the rate of locally testable affine-invariant codes. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 17, p. 108 (2010)
10. Borgs, C., Chayes, J.T., Lovász, L., Sós, V.T., Szegedy, B., Vesztergombi, K.: Graph limits and parameter testing. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, pp. 261-270. ACM, New York (2006)
11. Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. Journal of the ACM 45(6), 965-981 (1998)
12. Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM 45(4), 653-750 (1998)
13. Grigorescu, E., Kaufman, T., Sudan, M.: 2-transitivity is insufficient for local testability. In: Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, CCC 2008, College Park, Maryland, USA, June 23-26, pp. 259-267. IEEE Computer Society, Los Alamitos (2008)
14. Grigorescu, E., Kaufman, T., Sudan, M.: Succinct Representation of Codes with Applications to Testing. In: Dinur, I., Jansen, K., Naor, J., Rolim, J.D.P. (eds.) APPROX-RANDOM 2009. LNCS, vol. 5687, pp. 534-547. Springer, Heidelberg (2009)
15. Jutla, C.S., Patthak, A.C., Rudra, A., Zuckerman, D.: Testing low-degree polynomials over prime fields. Random Struct. Algorithms 35(2), 163-193 (2009)
16. Katz, J., Trevisan, L.: On the efficiency of local decoding procedures for errorcorrecting codes. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, STOC 2000, pp. 80-86. ACM, New York (2000)
17. Kaufman, T., Ron, D.: Testing polynomials over general fields. SIAM J. on Computing 36(3), 779-802 (2006)
18. Kaufman, T., Lovett, S.: Testing of exponentially large codes, by a new extension to Weil bound for character sums. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 17, p. 65 (2010)
19. Kaufman, T., Sudan, M.: Algebraic property testing: the role of invariance. In: Dwork, C. (ed.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, pp. 403-412. ACM, New York (2008)
20. Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM J. on Computing 25(2), 252-271 (1996)
21. Sudan, M.: Invariance in property testing. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 17, p. 51 (2010)