Constant depth circuits, Fourier transform, and learnability
暂无分享,去创建一个
[1] J. Håstad. Computational limitations of small-depth circuits , 1987 .
[2] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[3] Harry Dym,et al. Fourier series and integrals , 1972 .
[4] Andrew Chi-Chih Yao,et al. Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.
[5] Noam Nisan,et al. Approximate Inclusion-Exclusion , 1990, STOC '90.
[6] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[7] Nathan Linial,et al. The influence of variables on Boolean functions , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[8] Noam Nisan,et al. Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[9] Avi Wigderson,et al. Deterministic simulation of probabilistic constant depth circuits , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[10] Manuel Blum,et al. Generic oracles and oracle classes , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[11] Roman Smolensky,et al. Algebraic methods in the theory of lower bounds for Boolean circuit complexity , 1987, STOC.
[12] Noam Nisan,et al. The computational complexity of universal hashing , 1990, STOC '90.
[13] 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.
[14] Silvio Micali,et al. How to construct random functions , 1986, JACM.
[15] Miklós Ajtai,et al. ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..