Journal of the ACM Bibliography

Selected papers that cite this one

• Shai Ben-David and Eli Dichterman. Learning with restricted focus of attention. Journal of Computer and System Sciences, 56(3):277-298, April 1998.

• Carlos Domingo, Tatsuie Tsukiji, and Osamu Watanabe. Partial Occam's Razor and its applications. Information Processing Letters, 64(4):179-185, 28 November 1997.

• William I. Gasarch and Carl H. Smith. Learning via queries. Journal of the ACM, 39(3):649-674, July 1992.

• D. Haussler, N. Littlestone, and M. K. Warmuth. Predicting {0,1}-functions on randomly drawn points. Information and Computation, 115(2):248-292, December 1994.

Selected references

• Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred Warmuth. Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension (extended abstract). In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pages 273-282, Berkeley, California, 28-30 May 1986.

• 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 City, 25-27 May 1987.

• Michael Kearns and Leslie G. Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 433-444, Seattle, Washington, 15-17 May 1989.

• B. K. Natarajan. On learning Boolean functions. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 296-304, New York City, 25-27 May 1987.

• Leonard Pitt and Leslie G. Valiant. Computational limitations on learning from examples. Journal of the ACM, 35(4):965-984, October 1988.

Shortcuts: