Testing linear-invariant non-linear properties

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 135-146

  Bhattacharyya, Arnab ^a   Chen, Victor ^a   Sudan, Madhu ^a   Xie, Ning ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORBIDDEN PATTERN; LINEAR MAPS; LINEAR PROPERTIES; LINEARITY TEST; NONLINEAR PROPERTIES; PROPERTY-TESTING; REED-MULLER CODES; SYSTEMATIC STUDY;

BOOLEAN FUNCTIONS; COMPUTER SCIENCE; FORWARD ERROR CORRECTION; LINEAR SYSTEMS; LINEAR TRANSFORMATIONS;

COMBINATORIAL MATHEMATICS;

EID: 84880198687     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. Noga Alon, Eldar Fischer, Ilan Newman and Asaf Shapira. A combinatorial characterization of the testable graph properties: it's all about regularity. STOC'06:251-260, 2006.
2. Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn and Dana Ron, Testing low-degree polynomials over GF(2). Proceedings of Random 2003:188-199, 2003.
3. Noga Alon, Michael Krivelevich, Ilan Newman and Mario Szegedy. Regular languages are testable with a constant number of queries. SIAM Journal on Computing, 30(6):1842-1862, 2000.
4. Noga Alon and Asaf Shapira. Every monotone graph property is testable. STOC'05:128-137, 2005.
5. Noga Alon and Asaf Shapira. A Characterization of the (natural) graph properties testable with onesided error. FOCS'05:429-438, 2005.
6. Noga Alon and Asaf Shapira. Homomorphisms in graph property testing - a survey. Electronic Colloquium on Computational Complexity (ECCC), Report TR05-085, 2005.
7. Sanjeev Arora, Carsten Lund, Rajeev Motwani, Madhu Sudan and Mario Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45(3):501-555, 1998.
8. Sanjeev Arora and Shmuel Safra. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 45(1):70-122, 1998.
9. László Babai, Lance Fortnow and Carsten Lund. Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity, 1(1):3-40, 1991.
10. Mihir Bellare, Don Coppersmith, Johan Håstad, Marcos A. Kiwi and Madhu Sudan. Linearity testing over characteristic two. IEEE Transactions on Information Theory, 42(6):1781-1795, 1996.
11. Mihir Bellare, Oded Goldreich and Madhu Sudan. Free bits, PCPs, and nonapproximability - towards tight results. SIAM Journal on Computing, 27(3):804-915, 1998.
12. Manuel Blum, Michael Luby and Ronitt Rubinfeld. Self-testing/correcting with applications to numerical problems. Journal of Computer and System Sciences, 47(3):549-595, 1993.
13. Christian Borgs, Jennifer T. Chayes, László Lovász, Vera T. Sós, Balázs Szegedy and Katalin Veszter-gombi. Graph limits and parameter testing. STOC'06:261-270, 2006.
14. Arnab Bhattacharyya, Victor Chen, Madhu Sudan and Ning Xie. Testing linear-invariant non-linear properties. Electronic Colloquium on Computational Complexity (ECCC), Report TR08-088, 2008.
15. Oded Goldreich, Shafi Goldwasser and Dana Ron. Property testing and its connection to learning and approximation. Journal of the ACM, 45(4):653-750, 1998.
16. Ben Green. A Szemerédi-type regularity lemma in abelian groups, with applications. Geometric and Functional Analysis, 15(2):340-376, 2005.
17. Ben Green and Terence Tao. Linear equations in primes. Annals of Mathematics, to appear.
18. Johan Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001.
19. Johan Håstad and Avi Wigderson. Simple analysis of graph tests for linearity and PCP. Random Structures and Algorithms, 22(2):139-160, 2003.
20. Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra and David Zuckerman. Testing low-degree polynomials over prime fields. FOCS'04:423-432, 2004.
21. Tali Kaufman and Dana Ron. Testing polynomials over general fields. FOCS'04:413-422, 2004.
22. Tali Kaufman and Madhu Sudan. Algebraic property testing: the role of invariance. STOC'08: 403-412, 2008.
23. Daniel Král', Oriol Serra and Lluís Vena. A combinatorial proof of the removal lemma for groups. arXiv:0804.4847, 2008.
24. Michal Parnas, Dana Ron and Alex Samorodnitsky. Testing basic Boolean formulae. SIAM Journal on Discrete Mathematics, 16(1):20-46, 2003.
25. Ronitt Rubinfeld and Madhu Sudan. Robust characterizations of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252-271, 1996.
26. Alex Samorodnitsky and Luca Trevisan. A PCP characterization of NP with optimal amortized query complexity. STOC'00:191-199, 2000.
27. Alex Samorodnitsky and Luca Trevisan. Gowers uniformity, influence of variables, and PCPs. STOC'06:11-20, 2006.
28. Asaf Shapira. A proof of Green's conjecture regarding the removal properties of sets of linear equations. arXiv:0807.4901, 2008.
29. William T. Tutte. Matroids and graphs. Transactions of the American Mathematical Society, 90:527-552, 1959.
30. Dominic J.A. Welsh. Matroid Theory. Academic Press Inc., London, 1976.