A lower bound for distribution-free monotonicity testing

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 330-341

  Halevy, Shirley ^a   Kushilevitz, Eyal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; QUERY LANGUAGES; TESTING;

DISTRIBUTION-FREE MONOTONICITY TESTING; DISTRIBUTION-FREE PROPERTY TESTING; MONOTINICITY TESTING OF FUNCTIONS; QUERY COMPLEXITY;

BOOLEAN FUNCTIONS;

EID: 26944468262     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538462_28     Document Type: Conference Paper

References (28)

1. N. Alon, E. Fischer, M. Krivelevich, and M. szegedy, Efficient testing of large graphs, FOCS 1999, pages 656-666.
2. T. Batu, R. Rubinfeld, and P. White, Fast approximation PCPs for multidimensional bin-packing problems, RANDOM-APPROX 1999, pages 246-256,.
3. M. Blura, M. Luby, and R. Rubinfeld, Self testing/correcting with applications to numerical problems, Journal of Computer and System Science 47:549-595, 1993.
4. A. Bogdanov, K. Obata, and L. Trevisan, A tower bound for testing 3-colorability in bounded-degree graphs, FOCS, 2002, pages 93-102.
5. A. Czumaj and C. Sohler, Testing hypergraph coloring, ICALP 2001, pp. 493-505.
6. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, and A. Samorodnitsky, Improved testing algorithms for monotonicity, RANDOM-APPROX 1999, pages 97-108.
7. E. Ergün, S. Kannan, R. Kumar, R. Rubinfeld, and M. Viswanathan, Spotcheckers, Journal of Computing and System Science, 60:717-751, 2000
8. (a preliminary version appeared in STOC 1998).
9. E. Fischer, On the strength of comparisons in property testing, manuscript
10. (available at ECCC 8(8): (2001)).
11. E. Fischer, The art of uninformed decisions: A primer to property testing, The Computational Complexity Column of The bulletin of the European Association for Theoretical Computer Science, 75:97-126, 2001.
12. E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld and, A. Samorodnitsky, Monotonicity testing over general poset domains, STOC 2002, pages 474-483.
13. E. Fischer and I. Newman, Testing of matrix properties, STOC 2001, pages 286-295.
14. O. Goldreich, Combinatorical property testing - a survey, In: Randomized Methods in Algorithms Design, AMS-DIMACS pages 45-61, 1998.
15. O. Goldreich, S. Goldwasser, E. Lehman, D. Ron, and A. Samorodnitsky, Testing Monotonicity, Combinatorica, 20(3):301-337, 2000
16. (a preliminary version appeared in FOCS 1998).
17. O. Goldreich, S. Goldwasser, and D. Ron, Property testing and its connection to learning and approximation, Journal of the ACM, 45(4):653-750, 1998
18. (a preliminary version appeared in FOCS 1996).
19. O. Goldreich and D. Ron, Property testing in bounded degree graphs, STOC 1997, pages 406-415.
20. O. Goldreich and L. Trevisan, Three theorems regarding testing graph properties, FOCS 2001, pages 302-317.
21. S. Halevy and E. Kushilevitz, Distribution-free property testing. In RANDOM-APPROX 2003, pages 341-353.
22. S. Halevy and E. Kushilevitz, Testing monotonicity over graph products, ICALP 2004, pages 721-732.
23. S. Halevy and E. Kushilevitz, Distribution-free connectivity testing. In RANDOM-APPROX 2004, pages 393-404.
24. T. Kaufman, M. Krivelevich, and D. Ron, Tight bounds for testing bipartiteness in general graphs, RANDOM-APPROX 2003, pages 341-353.
25. M. J. Kearns and U. V. Vzirani, An introduction to Computational Learning Theory, MIT Press, 1994.
26. D. Ron, Property testing (a tutorial), In: Handbook of Randomized Computing (S.Rajasekaran, P. M. Pardalos, J. H. Reif and J. D. P. Rolin eds), Kluwer Press (2001).
27. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM Journal of Computing, 25(2):252-271, 1996.
28. (first appeared as a technical report, Cornell University, 1993).