On the strength of comparisons in property testing

Information and Computation

Volumn 189, Issue 1, 2004, Pages 107-116

  Fischer, Eldar ^a,b  

^a NEC LABORATORIES AMERICA   (United States)

^b Center for Discrete Mathematics and Theoretical Computer Science   (United States)

Author keywords

Monotonicity; Property testing; Ramsey's theorem

Indexed keywords

ADAPTIVE ALGORITHMS; BINARY SEQUENCES; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; CONTEXT FREE LANGUAGES; CONVERGENCE OF NUMERICAL METHODS; FUNCTION EVALUATION; PROBABILITY DENSITY FUNCTION; RANDOM PROCESSES; THEOREM PROVING;

MONOTONICITY; PROPERTY TESTING; RAMSEY THEOREM;

GRAPH THEORY;

EID: 1342287021     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2003.09.003     Document Type: Article

References (13)

1. N. Alon, E. Fischer, M. Krivelevich, M. Szegedy, Efficient testing of large graphs, Combinatorica 20 (2000) 451-476.
2. N. Alon, M. Krivelevich, I. Newman, M. Szegedy, Regular languages are testable with a constant number of queries, SIAM J. Comput. 30 (2001) 1842-1862.
3. T. Batu, R. Rubinfeld, P. White, Fast approximation PCPs for multidimensional bin-packing problems, in: D. Hochbaum, K. Jansen, J.P.D. Rolim, A. Sinclair (Eds.), Proceedings of the Third International Workshop on Randomization and Approximation Techniques in computer science, Springer-Verlag, Berkeley, CA, 1999, pp. 245-256.
4. B. Bollobás, Extremal Graph Theory, Academic Press, New York, 1978.
5. D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Transforming comparison model lower bounds to the parllel-random-access-machine, Inf. Process. Lett. 62 (1997) 103-110.
6. Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, A. Samorodnitsky, Improved testing algorithms for monotonicity, in: D. Hochbaum, K. Jansen, J.P.D. Rolim, A. Sinclair (Eds.), Proceedings of the Third International Workshop on Randomization and Approximation Techniques in Computer Science, Springer-Verlag, Berkeley, CA, 1999, pp. 97-108.
7. F. Ergün, S. Kannan, R. Kumar, R. Rubinfeld, M. Viswanathan, Spot checkers, J. Comput. Syst. Sci. 60 (2000) 717-751.
8. E. Fischer, E. Lehman, I. Newman, S. Raskhodnikova, R. Rubinfeld, A. Samorodnitsky, Monotonicity testing over general poset domains, Proc. 34th ACM STOC (2002) 474-483.
9. O. Goldreich, S. Goldwasser, E. Lehman, D. Ron, A. Samorodnitsky, Testing monotonicity, Combinatorica 20 (2000) 301-337 (a preliminary version written by the first four authors appeared in Proc. 39th FOCS, 1998).
10. O. Goldreich, S. Goldwasser, D. Ron, Property testing and its connection to learning and approximation, J. ACM 45 (1998) 653-750 (a preliminary version appeared in Proc. 37th FOCS, 1996).
11. O. Goldreich, D. Ron, Property testing in bounded degree graphs, Algorithmica 32 (2002) 302-343 (a preliminary version appeared in Proc. 29th STOC, 1997).
12. R.L. Graham, B.L. Rothschild, J.H. Spencer, Ramsey Theory, second ed., Joe Wiley and Sons, New York, 1990.
13. R. Rubinfeld, M. Sudan, Robust characterization of polynomials with applications to program testing, SIAM J. Comput. 25 (1996) 252-271.