Testing of matrix-poset properties

Combinatorica

Volumn 27, Issue 3, 2007, Pages 293-327

  Fischer, Eldar ^a   Newman, Ilan ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 44449089907     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-007-2154-3     Document Type: Article

References (27)

1. N. Alon, E. Fischer, M. Krivelevich and M. Szegedy: Efficient testing of large graphs, Combinatorica 20(4) (2000), 451-476.
2. N. Alon, E. Fischer and I. Newman: Testing of bipartite graph properties, SIAM J. of Computing, to appear.
3. N. Alon, M. Krivelevich, I. Newman and M. Szegedy: Regular languages are testable with a constant number of queries, SIAM J. of Computing 30(6) (2000), 1842-1862.
4. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy: Proof verification and the hardness of approximation problems, JACM 45(3) (1998), 501-555.
5. T. Batu, R. Rubinfeld, P. White: Fast approximate PCPs for multidimensional bin-packing problems, in: RANDOM-APPROX99 Conference Proceedings, pages 245-256, 1999.
6. M. Blum, M. Luby and R. Rubinfeld: Self-testing/correcting with applications to numerical problems, JCSS 47(3) (1993), 549-595.
7. nd edition), Springer, 2000.
8. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron and A. Samorodnitsky: Improved testing algorithms for monotonicity, in: 3rd RANDOM Conference Proceedings, pages 97-108, Springer-Verlag, Berkeley CA, 1999.
9. F. Ergün, S. Kannan, S. R. Kumar, R. Rubinfeld and M. Vviswanathan: Spot checkers, JCSS 60(3) (2000), 717-751.
10. E. Fischer: On the strength of comparisons in property testing, Information and Computation 189 (2004), 107-116.
11. th SODA Conference Proceedings, pages 873-882, 2001.
12. Also: Random Structures and Algorithms 26(3) (2005), 289-309.
13. E. Fischer: The art of uninformed decisions: A primer to property testing; Computational Complexity Column, The Bulletin of the European Association for Theoretical Computer Science 75 (2001), 97-126.
14. th ACM STOC Conference Proceedings, pages 474-483, 2002.
15. rd ACM STOC Conference Proceedings, pages 286-295, 2001.
16. E. Fischer, I. Newman and J. Sgall: Functions that have read-twice constant width branching programs are not necessarily testable, Random Structures and Algorithms 24(2) (2004), 175-193.
17. rd ACM STOC Conference Proceedings, pages 32-42, 1991.
18. O. Goldreich, S. Goldwasser, E. Lehman, D. Ron and A. Samorodnitsky: Testing monotonicity, Combinatorica 20(3) (2000), 301-337.
19. O. Goldreich, S. Goldwasser and D. Ron: Property testing and its connections to learning and approximation, JACM 45(4) (1998), 653-750.
20. O. Goldreich and D. Ron: Property testing in bounded degree graphs. Algorithmica 32(2) (2002), 302-343.
21. T. Kovári, V. T. Sós and P. Turán: On a problem of K. Zarankiewicz, Colloq. Math. 3 (1954), 50-57.
22. I. Newman: Testing membership in languages that have small width branching programs, SIAM J. of Computing 31(5) (2002), 1557-1570.
23. D. Ron: Property testing (a tutorial), in: Handbook of Randomized Computing (S. Rajasekaran, P. M. Pardalos, J. H. Reif and J. D. P. Rolim eds.), Vol. II, Chapter 15, Kluwer Press, 2001.
24. R. Rubinfeld and M. Sudan: Robust characterization of polynomials with applications to program testing, SIAM J. of Computing 25(2) (1996), 252-271.
25. E. Szemerédi: Regular partitions of graphs, in: Proc. Colloque Inter. CNRS No. 260 (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau eds.), pages 399-401, 1978.
26. th IEEE FOCS Conference Proceedings, pages 222-227, 1977.
27. K. Zarankiewicz: Problem P 101, Colloq. Math. 2 (1951), 116-131.