Neural networks and complexity theory
- 1 January 1992
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Training a 3-node neural network is NP-completeNeural Networks, 1992
- On the power of small-depth threshold circuitscomputational complexity, 1991
- Efficient simulation of finite automata by neural netsJournal of the ACM, 1991
- On the convergence properties of the Hopfield modelProceedings of the IEEE, 1990
- Neural computation of arithmetic functionsProceedings of the IEEE, 1990
- Multilayer feedforward networks are universal approximatorsNeural Networks, 1989
- Relating Boltzmann machines to conventional models of computationNeural Networks, 1989
- On the approximate realization of continuous mappings by neural networksNeural Networks, 1989
- On connectionist modelsCommunications on Pure and Applied Mathematics, 1988
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984