On the complexity of learning with a small number of nodes (1992)
by
Ian Parberry
| Venue: | In Proceedings of the International Joint Conference on Neural Networks |
| Citations: | 2 - 0 self |
BibTeX
@INPROCEEDINGS{Parberry92onthe,
author = {Ian Parberry},
title = {On the complexity of learning with a small number of nodes},
booktitle = {In Proceedings of the International Joint Conference on Neural Networks},
year = {1992},
pages = {893--898},
publisher = {IEEE Press}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
It is shown that the loading problem for a 6 node neural network with node function set AC 0 1 (that is, the conjunction or disjunction of a subset of the inputs or their complements) is NP complete. It can be deduced from this observation that the loading problem for a 6 node analog neural network is NP hard. 1
Citations
| 186 | Training a 3-node neural networks is np-complete - Blum, Rivest - 1992 |
| 115 | circuits, and the polynomial time hierarchy - FURST, SAXE, et al. |
