The expressive power of voting polynomials
Fast learning of k-term DNF formulas with queries
Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC ’92
Proceedings of the twenty-third annual ACM symposium on Theory of computing - STOC ’91
Richard Beigel
James Aspnes
Avrim Blum
Merrick Furst
On the degree of Boolean functions as real polynomials
A technique for upper bounding the spectral norm with applications to learning