Distribution-free property testing

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

Volumn 2764, Issue , 2003, Pages 302-317

  Halevy, Shirley ^a   Kushilevitz, Eyal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

CENTRAL PROBLEMS; DISTRIBUTION-FREE; DISTRIBUTION-FREE MONOTONICITY TESTING; DISTRIBUTION-FREE PROPERTY TESTING; PROPERTY-TESTING; QUERY COMPLEXITY; TESTING ALGORITHM; UNIFORM DISTRIBUTION;

APPROXIMATION ALGORITHMS;

EID: 35248887089     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_26     Document Type: Article

References (42)

1. st Annual Symposium on Foundations of Computer Science, pages 240-251, 2000.
2. th Annual Symposium on Foundations of Computer Science, pages 656-666, 1999.
3. N. Alon, T. Kaufman, M. Krivelevich, S. Litsyn, and D. Ron, Testing low-degree polynomials over GF(2). To appear in Proceedings of Random 2003.
4. 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
5. th Annual Symposium on Foundations of Computer Science, pages 645-655, 1999).
6. th SODA, 2001.
7. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof verification and the hardness of approximation problems, JACM, 45(1):501-555, 1998,
8. th FOCS, 1992).
9. S. Arora and S. Safra, Probabilistic checkable proofs: A new characterization of NP. JACM, 45(1):70-122, 1998
10. rd FOCS, 1992).
11. th ACM STOC 485-495,1997.
12. rd International Workshop on Randomization and Approximation Techniques in Computer Science 246-256,1999.
13. M. Blum, M. Luby, and R. Rubinfeld, Self testing/correcting with applications to numerical problems, Journal of Computer and System Sceince 47:549-595, 1993.
14. N. Bshouty, Private communication.
15. A. Czumaj and C. Sohler, Testing hypergraph coloring, ICALP 2001, 493-505.
16. rd International Workshop on Randomized and Approximation Techniques in Computer Science, pages 97-108, 1999.
17. E. Ergün, S. Kannan, R. Kumar, R. Rubinfeld, and M. Viswanathan, Spot-checkers, Journal of Computing and System Science, 60:717-751, 2000
18. th STOC ,1998).
19. E. Fischer, On the strength of comparisons in property testing, manuscript (available at ECCC TR00-083).
20. 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.
21. rd FOCS 103-112,2002.
22. th ACM STOC 474-483,2002.
23. rd ACM STOC, pages 286-295, 2001.
24. rd Annual ACM Symposium on Theory of Computing, pages 32-42, 1991.
25. O. Goldreich, Combinatorical property testing - a survey, In: Randomized Methods in Algorithms Design (P. Pardalos, S. Rajasekaran and J. Rolim eds.), AMS-DIMACS pages 45-61, 1998 .
26. O. Goldreich, S. Goldwasser, E. Lehman, D. Ron, and A. Samorodnitsky, Testing Monotonicity, Combinatorica, 20(3):301-337, 2000
27. th FOCS, 1998).
28. O. Goldreich, S. Goldwasser, and D. Ron, Propert testing and its connection to learning and approximation, Journal of the ACM, 45(4):653-750, 1998
29. th FOCS, 1996).
30. st Annual ACM Symposium on the Theory of Computing, pages 406-415, 1997.
31. O. Goldreich and L. Trevisan, Three theorems regarding testing graph properties. In Proceedings of FOCS 2001, pages 460-469.
32. M. J. Kearns and U. V. Vzirani, An introduction to Computational Learning Theory, MIT Press, 1994.
33. Y. Kohayakawa, B. Nagle, and V. Rodl, Efficient testing of hypergraphs. In Proceedings of ICALP 2002.
34. st Annual Symposium of Foundations of Computer Science, pages 251-258, 2000.
35. rd ACM STOC (2001), pages 276-285.
36. M. Parnas, and D. Ron, Testing the diameter of graphs, RANDOM APPROX (1999), 85-96.
37. th International Workshop on Randomization and Approximation Techniques in Computer Science (2001), pages 261-272.
38. M. Parnas, D. Ron, and A. Samorodnitsky, Proclaiming dictators and juntas ot testing boolean formulae, RANDOM APPROX (2001), 273-284.
39. 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).
40. R. Rubinfeld, Robust functional equations and their applications to program testing. In: SIAM Journal on Computing, 28(6):1972-1997, 1999
41. th Annual Symposium of Foundations of Computer Science, 1994).
42. R. Rubinfeld and M. Sudan, Robust characterization of polynomials with applocations to program testing, SIAM Journal of Computing, 25(2):252-271, 1996. (first appeared as a technical report, Cornell University, 1993).