On the computational power of depth 2 circuits with threshold and modulo gates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A weight-size trade-off for circuits with MOD m gates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The linear-array problem in communication complexity resolved
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
SIGACT News complexity theory column 32
ACM SIGACT News
Relations Between Communication Complexity, Linear Arrangements, and Computational Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Upper and Lower Bounds for Some Depth-3 Circuit Classes
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The Communication Complexity of the Universal Relation
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Some properties of MODmcircuits computing simple functions
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
| Hi-index | 0.00 |
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.