1. Baum, E. B. and Haussler, D. What size net gives valid generalization? In Advances in Neural Information Processing Systems I (1989) 81–90.
2. Blum, A. On the computational complexity of training simple neural networks. Master's thesis, MIT Department of Electrical Engineering and Computer Science. (Published as Laboratory for Computer Science Technical Report MIT/LCS/TR-445) (1989).
3. Blum, A. An Õ(n0.4)-approximation algorithm for 3-coloring (and improved approximation algorithms for k-coloring). In Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing (1989) 535–542.
4. Blum, A. and Rivest, R. L. Training a 3-node neural network is NP-Complete. In Proceedings of the 1988 Workshop on Computational Learning Theory (1988) 9–18.
5. Blum, A. and Rivest, R. L. Training a 3-node neural net is NP-Complete. In David S. Touretzky, editor, Advances in Neural Information Processing Systems I (1989) 494–501.