Communications of the ACM
On the learnability of Boolean formulae
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Information Processing Letters
Mistake bounds and logarithmic linear-threshold learning algorithms
Mistake bounds and logarithmic linear-threshold learning algorithms
Learnable and Nonlearnable Visual Concepts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern languages are not learnable
COLT '90 Proceedings of the third annual workshop on Computational learning theory
A polynomial-time algorithm for learning k-variable pattern languages from examples
COLT '89 Proceedings of the second annual workshop on Computational learning theory
Learning 2u DNF formulas and ku decision trees
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Computational learning theory: survey and selected bibliography
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast learning of k-term DNF formulas with queries
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Learning Boolean Functions in an Infinite Attribute Space
Machine Learning
Machine Learning
On learning Read-k-Satisfy-j DNF
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Learning DNF over the uniform distribution using a quantum example oracle
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - STOC 2001
Learning to reason the non monotonic case
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Hi-index | 0.04 |