Godbeer, G. H., Lipscomb, J., & Luby, M. (1988). On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets). Univ. of Toronto, Dep. of Computer Science.
Chicago-Zitierstil (17. Ausg.)Godbeer, Gail H., John Lipscomb, und Michael Luby. On the Computational Complexity of Finding Stable State Vectors in Connectionist Models (Hopfield Nets). Toronto: Univ. of Toronto, Dep. of Computer Science, 1988.
MLA-Zitierstil (9. Ausg.)Godbeer, Gail H., et al. On the Computational Complexity of Finding Stable State Vectors in Connectionist Models (Hopfield Nets). Univ. of Toronto, Dep. of Computer Science, 1988.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.