On the Fourier spectrum of monotone functions

Crytographic limitations on learning Boolean formulae and finite automata

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing

A general lower bound on the number of examples needed for learning

COLT '88 Proceedings of the first annual workshop on Computational learning theory

Learning decision trees using the Fourier spectrum

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing

Learning monotone ku DNF formulas on product distributions

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

Improved learning of AC0 functions

COLT '91 Proceedings of the fourth annual workshop on Computational learning theory

An O(nlog log n) learning algorithm for DNF under the uniform distribution

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory

A technique for upper bounding the spectral norm with applications to learning

COLT '92 Proceedings of the fifth annual workshop on Computational learning theory

Polynomial threshold functions, AC0 functions, and spectral norms

SIAM Journal on Computing

Efficient noise-tolerant learning from statistical queries

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Constant depth circuits, Fourier transform, and learnability

Journal of the ACM (JACM)

The shrinking generator

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology

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

Computational Complexity of Machine Learning

Computational Complexity of Machine Learning

A theory of the learnable

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing