Distribution-free property-testing

SIAM Journal on Computing

Volumn 37, Issue 4, 2007, Pages 1107-1138

  Halevy, Shirley ^a   Kushilevitz, Eyal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Distribution free property testing; Distribution free testing lower bounds; Low degree testing; Monotonicity testing; Property testing

Indexed keywords

CHLORINE COMPOUNDS; JAVA PROGRAMMING LANGUAGE; REAL TIME SYSTEMS; STANDARDS;

CENTRAL PROBLEMS; DISTRIBUTION-FREE; DISTRIBUTION-FREE PROPERTY-TESTING; DISTRIBUTION-FREE TESTING LOWER BOUNDS; LOW-DEGREE TESTING; MONOTONICITY TESTING; MULTIVARIATE POLYNOMIALS; ORACLE ACCESS; PROPERTY-TESTING; QUERY COMPLEXITY; RANDOM SAMPLING; TESTING ALGORITHMS; UNIFOR M DISTRIBUTION;

DISTRIBUTION FUNCTIONS;

EID: 49449095305     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050645804     Document Type: Article

References (54)

1. N. ALON, S. DAR, M. PARNAS, AND D. RON, Testing of clustering, in Proceedings of the Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2000, pp. 240-251.
2. N. ALON, E. FISCHER, M. KRIVELEVICH, AND M. SZEGEDY, Efficient testing of large graphs, Combinatorica, 20 (2000), pp. 451-476;
3. also in Proceedings of the Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1999, pp. 656-666.
4. N. ALON, T. KAUFMAN, M. KRIVELEVICH, S. LITSYN, AND D. RON, Testing low-degree polynomials over GF(2), in Approximation, Randomization and Combinatorial Optimization (RANDOM-APPROX), Springer, Berlin, 2003, pp. 188-199.
5. N. ALON, M. KRIVELEVICH, I. NEWMAN, AND M. SZEGEDY, Regular languages are testable with a constant number of queries, SIAM J. Comput., 30 (2001), pp. 1842-1862;
6. preliminary version appeared in Proceedings of the Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1999, pp. 645-655.
7. N. ALON AND A. SHAPIRA, A characterization of easily testable induced subgraphs, in Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, SIAM, Philadephia, 2004, pp. 935-944.
8. N. ALON AND A. SHAPIRA, A characterization of the (natural) graph properties testable with one-sided error, in Proceedings of the 46th Annual Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2005, pp. 429-438.
9. N. ALON AND A. SHAPIRA, Every monotone graph property is testable, in Proceedings of the Symposium on Theory of Computing, ACM, New York, 2005, pp. 128-137.
10. N. ALON AND A. SHAPIRA, Testing satisfiability, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, SIAM, Philadephia, 2002, pp. 645-654.
11. S. ARORA, C. LUND, R. MOTWANI, M. SUDAN, AND M. SZEGEDY, Proof verification and the hardness of approximation problems, J. ACM, 45 (1998), pp. 501-555;
12. preliminary version appeared in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1992, pp. 14-23.
13. S. ARORA AND S. SAFRA, Probabilistic checkable proofs: A new characterization of NP, J. ACM, 45 (1998), pp. 70-122;
14. preliminary version appeared in Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1992, pp. 2-13.
15. S. ARORA AND M. SUDAN, Improved low-degree testing and its applications, in Proceedings of the Symposium on Theory of Computing, ACM, New York, 1997, pp. 485-495.
16. T. BATU, R. RUBINFELD, AND P. WHITE, Fast approximation PCPs for multidimensional bin-packing problems, in Randomization, Approximation, and Combinatorial Optimization (RANDOM-APPROX), Springer, Berlin, 1999, pp. 246-256.
17. M. BLUM, M. LUBY, AND R. RUBINFELD, Self testing/correcting with applications to numerical problems, J. Comput System Sci., 47 (1993), pp. 549-595.
18. A. BOGDANOV, K. OBATA, AND L. TREVISAN, A lower bound for testing 3-colorability in bounded-degree graphs, in Proceedings of the Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2002, pp. 93-102.
19. A. CZUMAJ AND C. SOHLER, Testing hypergraph coloring, in Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP), Springer, Berlin, 2001, pp. 493-505.
20. Y. DODIS, O. GOLDREICH, E. LEHMAN, S. RASKHODNIKOVA, D. RON, AND A. SAMORODNITSKY, Improved testing algorithms for monotonicity, in Randomization, Approximation, and Combinatorial Optimization (RANDOM-APPROX), 1999, Springer, Berlin, pp. 97-108.
21. E. ERGÜN, S. KANNAN. R. KUMAR, R. RUBINFELD, AND M. VISWANATHAN, Spot-checkers, J. Comput. System Sci., 60 (2000), pp. 717-751;
22. preliminary version appeared in Proceedings of the Symposium on Theory of Computing, ACM, New York, 1999, pp. 259-268.
23. E. FISCHER, On the strength of comparisons in property testing, Inform, and Comput., 189 (2004), pp. 107-116.
24. E. FISCHER, The art of uninformed decisions: A primer to property testing, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 75 (2001), pp. 97-126.
25. E. FISCHER, G. KINDLER, D. RON, S. SAFRA, AND A. SAMORODNITSKY, Testing juntas, in Proceedings of the Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2002, pp. 103-112.
26. E. FISCHER, E. LEHMAN, I. NEWMAN, S. RASKHODNIKOVA, R. RUBINFELD, AND A. SAMORODNITSKY, Monotonicity testing over general poset domains, in Proceedings of the Symposium on Theory of Computing, ACM, New York, 2002, pp. 474-483.
27. E. FISCHER AND I. NEWMAN, Testing of matrix properties, in Proceedings of the Symposium on Theory of Computing, ACM, New York, 2001, pp. 286-295.
28. O. GOLDREICH, Combinatorial property testing (a survey), in Randomization Methods in Algorithm Design (AMS-DIMACS), AMS, Providence, RI, 1999, pp. 45-59.
29. O. GOLDREICH, S. GOLDWASSER, E. LEHMAN, D. RON, AND A. SAMORODNITSKY, Testing monotonicity, Combinatorica, 20 (2000), pp. 301-337;
30. preliminary version appeared in Proceedings of the 39th Annual Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1998, pp. 426-435.
31. O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750; preliminary version appeared in Proceedings of the 37th Annual Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1996, pp. 339-348.
32. P. GEMMELL, R. LIPTON, R. RUBINFELD, M. SUDAN, AND A. WIGDERSON, Self testing/correcting for polynomials and for approximate functions, in Proceedings of the Symposium on Theory of Computing, ACM, New York, 1991, pp. 32-42.
33. O. GOLDREICH AND D. RON, On Testing Expansion in Bounded-Degree Graphs, Report TR00020, ECCC, 2000. Available online at http://eccc.hpi-web.de/eccc-reports/2000/TR00020/index.html
34. O. GOLDREICH AND D. RON, Property testing in bounded degree graphs, in Proceedings of the Symposium on Theory of Computing, ACM, New York, 1997, pp. 406-415.
35. O. GOLDREICH AND L. TREVISAN, Three theorems regarding testing graph properties, in Proceedings of the Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2001, pp. 302-317.
36. S. HALEVY AND E. KUSHILEVITZ, Distribution-free property testing, in Approximation, Randomization and Combinatorial Optimization (RANDOM-APPROX), Springer, Berlin, 2003, pp. 302-317.
37. S. HALEVY AND E. KUSHILEVITZ, Testing monotonicity over graph products, in Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP), Springer, Berlin, 2004, pp. 721-732.
38. S. HALEVY AND E. KUSHILEVITZ, Distribution-free connectivity testing, in Approximation, Randomization and Combinatorial Optimization (RANDOM-APPROX), Springer, Berlin, 2004, pp. 393-404.
39. S. HALEVY AND E. KUSHILEVITZ, A lower bound for distribution-free monotonicity testing, in Approximation, Randomization and Combinatorial Optimization (RANDOM-APPROX), Springer, Berlin, 2005, pp. 330-341.
40. T. KAUFMAN, M. KRIVELEVICH, AND D. RON, Tight bounds for testing bipartiteness in general graphs, in Approximation, Randomization and Combinatorial Optimization (RANDOM-APPROX), Springer, Berlin 2003, pp. 341-353.
41. Y. KOHAYAKAWA, B. NAGLE, AND V. RODL, Efficient testing of hypergraphs, in Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP), 2002, pp. 1017-1028.
42. T. KAUFMAN AND D. RON, Testing polynomials over general fields, in Proceedings of the Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2004, pp. 413-422.
43. M. J. KEARNS AND U. V. VZIRANI, An Introduction to Computational Learning Theory, MIT Press, Cambridge, MA, 1994.
44. R. J. LIPTON, New directions in testing, in Distributed Computing and Cryptography, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 2, AMS, Providence, RI, 1991, pp. 191-202.
45. I. NEWMAN, Testing of functions that have small width branching programs, in Proceedings of the Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 2000, pp. 251-258.
46. M. PARNAS AND D. RON, Testing metric properties, in Proceedings of the Symposium on Theory of Computing, ACM, New York, 2001, pp. 276-285.
47. M. PARNAS AND D. RON, Testing the diameter of graphs, in Randomization, Approximation, and Combinatorial Optimization (RANDOM-APPROX), Springer, Berlin, 1999, pp. 85-96.
48. M. PARNAS, D. RON, AND R. RUBINFELD, Testing parenthesis languages, in Randomization, Approximation, and Combinatorial Optimization (RANDOM-APPROX), Springer, Berlin, 2001, pp. 261-272.
49. M. PARNAS, D. RON, AND A. SAMORODNITSKY, Proclaiming dictators and juntas or testing Boolean formulae, in Approximation, Randomization and Combinatorial Optimization (RANDOM-APPROX), Springer, Berlin, 2001, pp. 273-284.
50. D. RON, Property testing, in Handbook of Randomized Computing, S. Rajasekaran, P. M. Pardalos, J. H. Reif, and J. D. P. Rolin, eds., Kluwer, Dordrecht, 2001, pp. 597-649.
51. R. RUBINFELD, Robust functional equations and their applications to program testing, SIAM J. Comput., 28 (1999), pp. 1972-1997;
52. preliminary version appeared in Proceedings of the 35th Annual Symposium of Foundations of Computer Science, IEEE, Los Alamitos, CA, 1994, pp. 288-299.
53. R. RUBINFELD AND M. SUDAN, Robust characterization of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271;
54. first appeared as a technical report, Cornell University, Ithaca, NY, 1993.