Learning the Fourier Spectrum of Probabilistic Lists and Trees (1991)

Cached

Download Links

by William Aiello , Milena Mihailt
Venue:In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms
Citations:7 - 0 self

Documents Related by Co-Citation

279 Constant depth circuits, Fourier transform, and learnability – N Linial, Y Mansour, N Nisan - 1993
32 Polynomial Threshold Functions, AC Functions and Spectral Norms – J Bruck, R Smolensky - 1992
1696 A Theory of the Learnable – L. G. Valiant - 1984
182 Computational limitations for small depth circuits – Johan H˚astad - 1986
356 A hard-core predicate for all one-way functions – Oded Goldreich, Leonid A. Levint - 1989
112 Σ1 1-formulae on finite structures – M Ajtai - 1983
21 A spectral lower bound technique for the size of decision trees and two-level AND/OR circuits – Y Brandman, A Orlitsky, J Hennessy - 1990
48 On the power of threshold circuits with small weights – Kai-Yeung Siu, Jehoshua Bruck - 1991
16 A Technique for Upper Bounding the Spectral Norm with Applications to Learning – Mihir Bellare - 1992
17 Improved learning of AC ~ functions – Merrick Furst, Jeffrey Jackson, Sean Smith - 1991
4 An O(n log log n ) learning algorihm for DNF under the uniform distribution – Yishay Mansour - 1992
223 The Influence of Variables on Boolean Functions (Extended Abstract) – Jeff Kahn, Gil Kalai, Nathan Linial - 1988
376 Learning Decision Lists – Ronald L. Rivest - 1987
192 Computational Limitations on Learning from Examples – Leonard Pitt, Leslie G. Valiant - 1988
311 Cryptographic Limitations on Learning Boolean Formulae and Finite Automata – Michael Kearns, Leslie Valiant - 1989
76 Cryptographic hardness of distribution-specific learning – M Kharitonov - 1993
2 Learning 2�� DNF and k�� decision trees – Thomas Hancock - 1991
13 Learning monotone k-� DNF formulas on product distributions – T HANCOCK, Y MANSOUR - 1991
205 A guided tour of chernoff bounds – T Hagerup, C Rüb - 1990