On Threshold Circuits and Polynomial Computation
- 1 October 1992
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 21 (5) , 896-908
- https://doi.org/10.1137/0221053
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- The complexity of computations by networksIBM Journal of Research and Development, 1987
- Log Depth Circuits for Division and Related ProblemsSIAM Journal on Computing, 1986
- Parallel computation with threshold functionsPublished by Springer Nature ,1986
- A Learning Algorithm for Boltzmann Machines*Cognitive Science, 1985
- Parallel Solution of Certain Toeplitz Linear SystemsSIAM Journal on Computing, 1984
- On probabilistic tape complexity and fast circuits for matrix inversion problemsPublished by Springer Nature ,1984
- Probabilistic Algorithms for Deciding Equivalence of Straight-Line ProgramsJournal of the ACM, 1983
- Connectionist Models and Their PropertiesCognitive Science, 1982
- Neural networks and physical systems with emergent collective computational abilities.Proceedings of the National Academy of Sciences, 1982
- New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and RecurrencesJournal of the ACM, 1976