Title :
Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in
Author :
Krause, Matthias ; Waack, Stephan
Author_Institution :
Dortmund Univ., Germany
Abstract :
An exponential lower bound for depth two circuits with arbitrary symmetric gates in the bottom level and with a MODm-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
Keywords :
computational complexity; logic circuits; logic gates; matrix algebra; threshold logic; MOD m gate; communication matrices; depth two circuits; exponential lower bound; symmetric gates; threshold gate; unbounded fan-in; variation rank; Circuit testing; Computational modeling; Concurrent computing; Polynomials; Symmetric matrices; Wires; Zinc;
Conference_Titel :
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Conference_Location :
San Juan
Print_ISBN :
0-8186-2445-0
DOI :
10.1109/SFCS.1991.185448
