Training a 3-node neural network is NP-complete

By Avrim Blum, R. Rivest. 1988

Citations in the corpus

• Deep learning in neural networks: An overview (2014, neutral): “In general, however, finding an NN that precisely models a given training set is an NP-complete problem (Judd, 1990; Blum and Rivest, 1992), also in the case of deep NNs (Sı́ma, 1994; de Souto et al.”