1. Some additional examples of bandwidth constrained NP-complete problems;Chung,1981
2. Complexity results for bandwidth minimization;Garey;SIAM J. Appl. Math.,1978
3. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
4. Complexity of Connectionist Learning with Various Node Functions;Judd,1987
5. Learning in networks is hard;Judd,1987