Training a 3-node neural network is NP-complete
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 9-28
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Training a 3-node neural network is NP-complete1993
- Neural Network Design and the Complexity of Learning1990
- Crytographic limitations on learning Boolean formulae and finite automata1989
- An O(n0.4)-approximation algorithm for 3-coloring1989
- On the learnability of Boolean formulae1987
- Improving the performance guarantee for approximate graph coloringJournal of the ACM, 1983