Communications of the ACM
On the learnability of Boolean formulae
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The computational complexity of machine learning
The computational complexity of machine learning
Improved learning of AC0 functions
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
Learning Boolean read-once formulas with arbitrary symmetric and constant fan-in gates
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On learning counting functions with queries
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
On the learnability of Zn-DNF formulas (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Learning cost-sensitive active classifiers
Artificial Intelligence
On Learning Embedded Midbit Functions
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Efficiently Approximating Weighted Sums with Exponentially Many Terms
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
On approximating weighted sums with exponentially many terms
Journal of Computer and System Sciences
On learning embedded midbit functions
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
An algebraic perspective on Boolean function learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
On PAC learning algorithms for rich boolean function classes
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Hi-index | 0.00 |