Almost optimal lower bounds for small depth circuits
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Log depth circuits for division and related problems
SIAM Journal on Computing
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Parallel computation with threshold functions
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
The complexity of Boolean networks
The complexity of Boolean networks
Analog VLSI and neural systems
Analog VLSI and neural systems
Circuits and local computation
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Some notes on threshold circuits, and multiplication in depth 4
Information Processing Letters
On the computational power of sigmoid versus boolean threshold circuits (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Approximating threshold circuits by rational functions
Information and Computation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Depth efficient neural networks for division and related problems
IEEE Transactions on Information Theory
Simulating threshold circuits by majority circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An Ω(√ log log n) lower bound for routing in optical networks
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
| Hi-index | 0.00 |