n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom

[1]  Alexander A. Razborov,et al.  On Small Depth Threshold Circuits , 1992, SWAT.

[2]  Alexander A. Razborov,et al.  Majority gates vs. general weighted threshold gates , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[3]  Matthias Krause,et al.  Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4]  Matthias Krause,et al.  Geometric arguments yield better bounds for threshold circuits and distributed computing , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[5]  Ran Raz,et al.  Super-logarithmic depth lower bounds via direct sum in communication complexity , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[6]  Johan Håstad,et al.  On the power of small-depth threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[7]  Andrew Chi-Chih Yao,et al.  ON ACC and threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8]  Noam Nisan,et al.  Multiparty protocols and logspace-hard pseudorandom sequences , 1989, STOC '89.

[9]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[10]  J. Håstad.  Computational limitations of small-depth circuits , 1987 .

[11]  A. Yao.  Separating the polynomial-time hierarchy by oracles , 1985 .

[12]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).