1. Occam's razor;Blumer;Information Processing Letters,1987
2. Paul Fischer and Hans Ulrich Simon. On learning ring-sum expansions. In these proceedings.
3. Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant. On the learnability of boolean formulae. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 285–295, New York, New York, May 1987.
4. Learning when irrelevant attributes abound: A new linear-threshold algorithm;Littlestone;Machine Learning,1988
5. Computational limitations on learning from examples;Pitt,1986