Testing monotonicity over graph products

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

Volumn 3142, Issue , 2004, Pages 721-732

  Halevy, Shirley ^a   Kushilevitz, Eyal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

CENTRAL PROBLEMS; GRAPH PRODUCT; LOW DIMENSIONAL; MODULAR DESIGNS; MONOTONICITY; MONOTONICITY TESTING; PROPERTY-TESTING; QUERY COMPLEXITY;

ARTIFICIAL INTELLIGENCE;

EID: 26944480506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_61     Document Type: Article

References (29)

1. N. Alon, E. Fischer, M. Krivelevich, and M. szegedy, Efficient testing of large graphs, FOCS 1999, pp. 656-666.
2. N. Alon, M. Krivelevich, I. Newman, and M. Szegedy, Regular languages are testable with a constant number of queries, SIAM Journal on Computing 30:1842-1862, 2001
3. (also appeared in Proceedings of FOCS 1999, pages 645-655).
4. T. Batu, R. Rubinfeld, and P. White, Fast approximation PCPs for multidimensional bin-packing problems, RANDOM-APPROX1999, 246-256,.
5. M. Blum, M. Luby, and R. Rubinfeld, Self testing/correcting with applications to numerical problems, Journal of Computer and System Science 47:549-595, 1993.
6. A. Bogdanov, K. Obata, and L. Irevisan, A lower bound for testing 3-colorability in bounded-degree graphs, FOCS, 2002, pp. 93-102.
7. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, and A. Samorodnitsky, Improved testing algorithms for monotonicity, RANDOM-APPROX 1999, pp. 97-108.
8. E. Ergün, S. Kannan, R. Kumar, R. Rubinfeld, and M. Viswanathan, Spot-checkers, Journal of Computing and System Science, 60:717-751, 2000
9. (a preliminary version appeared in STOC 1998).
10. E. Fischer, On the strength of comparisons in property testing, manuscript
11. (available at ECCC 8(8): (2001)).
12. 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.
13. E. Fischer, G. Kindler, D. Ron, S. Safra, and A. Saraorodnitsky, Testing Juntas, FOCS 2002, pages 103-112.
14. E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld and, A. Samorodnitsky, Monotonicity testing over general poset domains, STOC 2002, pp. 474-483.
15. E. Fischer and I. Newman, Testing of matrix properties, STOC 2001, pp. 286-295.
16. O. Goldreich, Combinatorical property testing - a survey, In: Randomized Methods in Algorithms Design, AMS-DIMACS pages 45-61, 1998 .
17. O. Goldreich, S. Goldwasser, E. Lehman, D. Ron, and A. Samorodnitsky, Testing Monotonicity, Combinatonca, 20(3):301-337, 2000
18. (a preliminary version appeared in FOCS 1998).
19. 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
20. (a preliminary version appeared in FOCS 1996).
21. O. Goldreich and D. Ron, On testing expansion in bounded-degree graphs. In Electronic Colloquium on Computational Complexity 7(20), 2000.
22. O. Goldreich and D. Ron, Property testing in bounded degree graphs, STOC 1997, pp. 406-415.
23. O. Goldreich and L. Trevisan, Three theorems regarding testing graph properties, FOCS 2001, pp. 302-317.
24. S. Halevy and E. Kushilevitz, Distribution-free property testing. In RANDOM-APPROX 2003, pp. 341-353.
25. T. Kaufman, M. Krivelevich, and D. Ron, Tight bounds for testing bipartiteness in genera/ graphs, RANDOM-APPROX 2003, pp. 341-353.
26. Y. Kohayakawa, B. Nagle, and V. Rodl, Efficient testing of hypergraphs, ICALP 2002, pp. 1017-1028.
27. M. Parnas, and D. Ron, Testing the diameter of graphs, RANDOM-APPROX 1999, pp. 85-96.
28. 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).
29. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM Journal of Computing, 25(2):252-271, 1996. (first appeared as a technical report, Cornell University, 1993).