[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science (1991)

San Juan, Puerto Rico

Oct. 1, 1991 to Oct. 4, 1991

ISBN: 0-8186-2445-0

pp: 777-782

M. Krause , Dortmund Univ., Germany

ABSTRACT

An exponential lower bound for depth two circuits with arbitrary symmetric gates in the bottom level and with a MOD/sub m/-gate in the top level is proved. This solves a problem posed by R. Smolensky (1990). The method uses the variation rank of communication matrices. A variant of this method is used for deriving lower bounds for the size of depth-two circuits having a threshold gate at the top.

INDEX TERMS

threshold gate, MOD m gate, communication matrices, depth two circuits, symmetric gates, unbounded fan-in, exponential lower bound, variation rank

CITATION

M. Krause,
S. Waack,
"Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in",

*[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science*, vol. 00, no. , pp. 777-782, 1991, doi:10.1109/SFCS.1991.185448CITATIONS