1. Alt, H., Behrends, B., & Blömer, J. (1991). Approximate Matching of Polygonal Shapes.Procs. of the 1991 ACM Symposium on Computational Geometry pp. 186?193.
2. Anthony, M., & Biggs, N. (1992).Computational Learning Theory: an Introduction, Cambridge University Press, 1992.
3. Attalah, M.J. (1983). A Linear Time Algorithm for the Hausdorff-distance between Convex Polygons.Information Processing Letters 17 pp. 207?209.
4. Baum, E.B., & Haussler, D. (1988). What Size Net Gives Valid Generalization?Neural Computation 1, pp. 151?160.
5. Ben-David, S., & Lindenbaum, M. (1993). Localization vs. Identification of Semi-Algebraic Sets.Proceedings of the 6th Annual ACM Conference on Computational Learning Theory, pp. 327?336.