On the learnability of boolean formulae (1987)
by
Michael Kearns
,
Leonard Pitt
| Venue: | In Proceedings of the nineteenth annual ACM symposium on theory of computing |
| Citations: | 155 - 19 self |
BibTeX
@INPROCEEDINGS{Kearns87onthe,
author = {Michael Kearns and Leonard Pitt},
title = {On the learnability of boolean formulae},
booktitle = {In Proceedings of the nineteenth annual ACM symposium on theory of computing},
year = {1987},
pages = {285--295},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Citations
| 8882 | Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979 |
| 1515 | A Theory of the Learnable - Valiant - 1984 |
| 439 | Learning regular sets from queries and counterexamples - Angluin - 1987 |
| 231 | Fast probabilistic algorithms for hamiltonian circuits and matchings - Angluin, Valiant - 1977 |
| 182 | Computational limitations on learning from examples - Pitt, Valiant - 1988 |
| 114 | Learning disjunctions of conjunctions - Valiant - 1985 |
| 64 | Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension - Blumer, Ehrenfeucht, et al. - 1988 |
| 49 | The complexity of near-optimal graph coloring - Garey, Johnson - 1976 |
| 5 | Identifying kcnf formulas from noisy examples - Angluin, Laird - 1986 |
| 5 | A new approximate graph coloring algorithm - Wigderson - 1982 |
| 3 | Learning Decision-Lists. Unpublished manuscript - Rivest - 1986 |
| 1 | Quantifying the Inductive Bias in Concept Learning. Unpublished manuscript - Haussler - 1986 |
