Green's Conjecture and Testing Linear-Invariant Properties

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2009, Pages 159-166

  Shapira, Asaf ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Boolean functions; Hypergraphs removal lemma; Property testing

Indexed keywords

ADDITIVE NUMBER THEORY; CONSTANT TIME ALGORITHMS; EXTREMAL; HIGH PROBABILITY; HYPERGRAPH THEORY; HYPERGRAPHS REMOVAL LEMMA; INVARIANT PROPERTIES; PROPERTY TESTING; SYSTEM OF EQUATIONS; TESTING ALGORITHM;

BOOLEAN FUNCTIONS; COMPUTATION THEORY; GRAPH THEORY; LINEAR EQUATIONS; NUMBER THEORY;

SET THEORY;

EID: 70350700906     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1536414.1536438     Document Type: Conference Paper

References (46)

1. N. Alon, Testing subgraphs in large graphs, Random Structures and Algorithms 21 (2002), 359-370.
2. N. Alon, R. A. Duke, H. Lefmann, V. Rödl and R. Yuster, The algorithmic aspects of the Regularity Lemma, J. of Algorithms 16 (1994), 80-109.
3. th FOCS, New York, NY, IEEE (1999), 656-666. Also: Combinatorica 20 (2000), 451-476.
4. N. Alon, E. Fischer, I. Newman and A. Shapira, A Combinatorial characterization of the testable graph properties: it's all about regularity, Proc. of STOC 2006, 251-260.
5. N. Alon, T. Kaufman, M. Krivelevich, S. Litsyn and D. Ron, Testing low-degree polynomials over GF(2), Proc. of RANDOM 2003, 188-199.
6. N. Alon and A. Shapira, Testing Subgraphs in Directed Graphs, Journal of Computer and System Sciences, 69 (2004), 354-382.
7. N. Alon and A. Shapira, Testing subgraphs in directed graphs, JCSS Journal of Computer and System Sciences, 69 (2004), 354-382
8. N. Alon and A. Shapira, A characterization of easily testable induced subgraphs, Combinatorics, Probability and Computing, 15 (2006), 791-805. Prelim. version in Proc. of SODA 2004.
9. N. Alon and A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, Proc. of FOCS 2005. Also, SIAM J. on Computing, 37 (2008), 1703-1727.
10. T. Austin and T. Tao, On the testability and repair of hereditary hypergraph properties, manuscript, 2008.
11. I. Baran, E. D. Demaine, and M. Pǎtraşcu, Subquadratic algorithms for 3SUM, Algorithmica, 50 (2008), to appear.
12. F. A. Behrend, On sets of integers which contain no three terms in arithmetic progression, Proc. National Academy ofSciences USA 32 (1946), 331-332.
13. E. Ben-Sasson, P. Harsha and S. Raskhodnikova, Some 3CNF properties are hard to test, SIAM J. on Computing 35 (2005), 1-21.
14. A. Bhattacharyya, V. Chen, M. Sudan and N. Xie, Testing linear-invariant non-linear properties, Electronic Colloquium on Computational Complexity, Report TR08-088, 2008.
15. M. Blum, M. Luby and R. Rubinfeld, Self-testing/correcting with applications to numerical problems, JCSS 47 (1993), 549-595.
16. A. Bogdanov, K. Obata and L. Trevisan, A lower bound for testing 3-colorability in bounded-degree graphs, Proc. of FOCS 2002, 93-102.
17. P. Candela, On systems of linear equations and uniform hypergraphs, manuscript, 2008.
18. A. Czumaj and C. Sohler, Sublinear-time algorithms, Bulletin of the EATCS, 89 (2006) 23-47.
19. J. Erickson, Lower bounds for linear satisfiability problems, Proc. of SODA 1995, 388-395.
20. E. Fischer and I. Newman, Testing versus estimation of graph properties, SIAM J. Comput. 37(2): 482-501 (2007).
21. P. Frankl and V. Rödl, Extremal problems on set systems, Random Structures and Algorithms 20 (2002), 131-164.
22. H. Furstenberg and Y. Katznelson, An ergodic Szemerédi theorem for commuting transformations, J. Analyse Math. 34 (1978), 275-291.
23. 2) problems in computational geometry, Comput. Geom. Theory Appl., 5 (1995), 165-185.
24. O. Goldreich, S. Goldwasser and D. Ron, Property testing and its connection to learning and approximation, JACM 45(4): 653-750 (1998).
25. T. Gowers, Hypergraph regularity and the multidimensional Szemerédi theorem, Ann. of Math. Volume 166, Number 3 (2007), 897-946.
26. T. Gowers, Quasirandomness, counting and regularity for 3-uniform hypergraphs, Combinatorics, Probability and Computing, 15 (2006), 143-184.
27. B. Green, A Szemerédi-type regularity lemma in abelian groups, GAFA 15 (2005), 340-376.
28. Y. Ishigami, A simple regularization of hypergraphs, available at http://arxiv.org/abs/math/0612838.
29. C. S. Jutla, A. C. Patthak, A. Rudra and D. Zuckerman, Testing low-degree polynomials over prime fields, Proc of FOCS 2004, 423-432.
30. T. Kaufman and S. Litsyn, Almost orthogonal linear codes are locally testable, Proc. of FOCS 2005, 317-326.
31. T. Kaufman and D. Ron, Testing polynomials over general fields, Proc. of FOCS 2004, 413-422.
32. T. Kaufman and M. Sudan, Algebraic property testing: the role of invariance, Proc. of STOC 2008, 403-412.
33. Y. Kohayakawa, B. Nagle, V. Rödl, M. Schacht and J. Skokan, The hypergraph regularity method and its applications, Proceedings of the National Academy of Sciences USA, 102(23): 8109-8113.
34. J. Komlós and M. Simonovits, Szemerédi's Regularity Lemma and its applications in graph theory. In: Combinatorics, Paul Erdös is Eighty, Vol II (D. Miklós, V. T. Sós, T. Szönyi eds.), János Bolyai Math. Soc., Budapest (1996), 295-352.
35. D. Král', O. Serra and L. Vena, A combinatorial proof of the removal lemma for groups, arXiv:0804.4847v1.
36. D. Král', O. Serra and L. Vena, A removal lemma for linear systems over finite fields, Jornadas de Matematica Discreta y algortimica, 2008.
37. K. Matulef, R. O'donnell, R. Rubinfeld and R. Servedio, Testing halfspaces, Proc. of SODA 2009, to appear.
38. B. Nagle, V. Rödl and M. Schacht, The counting lemma for regular k-uniform hypergraphs, Random Structures and Algorithms 28 (2006), 113-179.
39. V. Rödl and J. Skokan, Regularity lemma for k-uniform hypergraphs, Random Structures and Algorithms 25 (2004), 1-42.
40. K.F. Roth, On certain sets of integers, J. London Math. Soc. 28 (1953), 104-109.
41. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J. on Computing 25 (1996), 252-271.
42. I. Z. Ruzsa, Solving a linear equation in a set of integers I, Acta Arithmetica 65 (1993), 259-282.
43. I. Ruzsa and E. Szemerédi, Triple systems with no six points carrying three triangles, in Combinatorics (Keszthely, 1976), Coll. Math. Soc. J. Bolyai 18, Volume II, 939-945.
44. E. Szemerédi, Integer sets containing no k elements in arithmetic progression, Acta Arith. 27 (1975), 299-345.
45. E. Szemerédi, Regular partitions of graphs, In: Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau, eds.), 1978, 399-401.
46. T. Tao, A variant of the hypergraph removal lemma, J. Combin. Theory, Ser. A 113 (2006), 1257-1280.