Learning Boolean Functions via the Fourier Transform
暂无分享,去创建一个
[1] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[2] Miklós Ajtai,et al. ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..
[3] A. Yao. Separating the polynomial-time hierarchy by oracles , 1985 .
[4] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.
[5] J. Håstad. Computational limitations of small-depth circuits , 1987 .
[6] Nathan Linial,et al. The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[7] Noam Nisan,et al. Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.
[8] Leonid A. Levin,et al. A hard-core predicate for all one-way functions , 1989, STOC '89.
[9] Torben Hagerup,et al. A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..
[10] Alon Orlitsky,et al. A Spectral Lower Bound Techniqye for the Size of Decision Trees and Two Level AND/OR Circuits , 1990, IEEE Trans. Computers.
[11] Jehoshua Bruck,et al. Harmonic Analysis of Polynomial Threshold Functions , 1990, SIAM J. Discret. Math..
[12] William Aiello,et al. Learning the Fourier spectrum of probabilistic lists and trees , 1991, SODA '91.
[13] Jehoshua Bruck,et al. On the Power of Threshold Circuits with Small Weights , 1991, SIAM J. Discret. Math..
[14] Eyal Kushilevitz,et al. Learning decision trees using the Fourier spectrum , 1991, STOC '91.
[15] Yishay Mansour,et al. An O(nlog log n) learning algorithm for DNF under the uniform distribution , 1992, COLT '92.
[16] Mihir Bellare. A technique for upper bounding the spectral norm with applications to learning , 1992, COLT '92.
[17] Jehoshua Bruck,et al. Polynomial threshold functions, AC functions and spectrum norms , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[18] Michael Kharitonov,et al. Cryptographic hardness of distribution-specific learning , 1993, STOC.
[19] Yishay Mansour,et al. An O(n^(log log n)) Learning Algorithm for DNT under the Uniform Distribution , 1995, J. Comput. Syst. Sci..