Depth-size tradeoffs for neural computation
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 40 (12) , 1402-1412
- https://doi.org/10.1109/12.106225
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- On threshold circuits for parityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On Threshold Circuits and Polynomial ComputationSIAM Journal on Computing, 1992
- Constant depth circuits, Fourier transform, and learnabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- The complexity of computations by networksIBM Journal of Research and Development, 1987
- Parallel Prefix ComputationJournal of the ACM, 1980
- On the combinational complexity of certain symmetric Boolean functionsTheory of Computing Systems, 1976
- Bounds to Complexities of Networks for Sorting and for SwitchingJournal of the ACM, 1975
- Synthesis of threshold circuits for certain classes of Boolean functionsCybernetics and Systems Analysis, 1973
- The Realization of Symmetric Switching Functions with Linear-Input Logical ElementsIEEE Transactions on Electronic Computers, 1961
- Linear-Input LogicIEEE Transactions on Electronic Computers, 1961