Abstract
Property testing [15,9] is the study of the following class of problems.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ailon, N., Chazelle, B.: Information theory in property testing and monotonicity testing in higher dimensions. Information and Computation 204, 1704–1717 (2006)
Alon, N., Dar, S., Parnas, M., Ron, D.: Testing of clustering. SIAM Journal on Discrete Math. 16(3), 393–417 (2003)
Alon, N., Fischer, E., Newman, I., Shapira, A.: A combinatorial characterization of the testable graph properties: It’s all about regularity. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on the Theory of Computing (2006)
Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. Journal of the ACM 47, 549–595 (1993)
Ergun, F., Kannan, S., Kumar, S.R., Rubinfeld, R., Viswanathan, M.: Spot-checkers. Journal of Computer and System Sciences 60(3), 717–751 (2000)
Fischer, E.: The art of uninformed decisions: A primer to property testing. Bulletin of the European Association for Theoretical Computer Science 75, 97–126 (2001)
Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, S.: Testing juntas. Journal of Computer and System Sciences 68(4), 753–787 (2004)
Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samordinsky, A.: Testing monotonicity. Combinatorica 20(3), 301–337 (2000)
Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM 45(4), 653–750 (1998)
Halevy, S., Kushilevitz, E.: Distribution-free property testing. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 341–353. Springer, Heidelberg (2003)
Kearns, M., Ron, D.: Testing problems with sub-learning sample complexity. Journal of Computer and System Sciences 61(3), 428–456 (2000)
Kearns, M.J., Schapire, R.E., Sellie, L.M.: Toward efficient agnostic learning. Machine Learning 17(2-3), 115–141 (1994)
Parnas, M., Ron, D., Samorodnitsky, A.: Testing boolean formulae. SIAM Journal on Discrete Math. 16(1), 20–46 (2002)
Ron, D.: Property testing. In: Rajasekaran, S., Pardalos, P. M., Reif, J. H., Rolim, J. D. P.(eds.) Handbook on Randomization, Volume II, pp. 597–649 (2001)
Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing 25(2), 252–271 (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Ron, D. (2007). Property Testing: A Learning Theory Perspective . In: Bshouty, N.H., Gentile, C. (eds) Learning Theory. COLT 2007. Lecture Notes in Computer Science(), vol 4539. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72927-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-72927-3_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72925-9
Online ISBN: 978-3-540-72927-3
eBook Packages: Computer ScienceComputer Science (R0)