๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Minimum Manhattan Network is NP-Complete

โœ Scribed by Francis Y. L. Chin; Zeyu Guo; He Sun

Book ID
106150102
Publisher
Springer
Year
2011
Tongue
English
Weight
854 KB
Volume
45
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Training a 3-node neural network is NP-c
Training a 3-node neural network is NP-complete
โœ Avrim L. Blum; Ronald L. Rivest ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 956 KB

We consider a 2-layer, 3-node, n-input neural network whose nodes compute linear threshold functions of their inputs. We show that it is NP-complete to decide whether there exist weights and thresholds for this network so that it produces output consistent with a given set of training examples. We e