1. What size net gives valid generalization?;Baum,1989
2. On the computational complexity of training simple neural networks;Blum,1989
3. An Ō(n0.4)-approximation algorithm for 3-coloring (and improved approximation algorithms for k-coloring);Blum,1989
4. Training a 3-node neural network is NP-Complete;Blum,1988
5. Training a 3-node neural net is NP-Complete;Blum,1989