Neural computation of arithmetic functions
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the IEEE
- Vol. 78 (10), 1669-1675
- https://doi.org/10.1109/5.58350
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- On Threshold Circuits and Polynomial ComputationSIAM Journal on Computing, 1992
- Harmonic Analysis of Polynomial Threshold FunctionsSIAM Journal on Discrete Mathematics, 1990
- A note on the power of threshold circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Threshold circuits of bounded depthPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- The complexity of computations by networksIBM Journal of Research and Development, 1987
- Algebraic methods in the theory of lower bounds for Boolean circuit complexityPublished by Association for Computing Machinery (ACM) ,1987
- Log Depth Circuits for Division and Related ProblemsSIAM Journal on Computing, 1986
- Almost optimal lower bounds for small depth circuitsPublished by Association for Computing Machinery (ACM) ,1986
- Constant Depth ReducibilitySIAM Journal on Computing, 1984
- Parity, circuits, and the polynomial-time hierarchyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981