Luby M, Godbeer GH, Lipscomb J. (1988). On the computational complexity of finding stable state vectors in connectionist models (Hopfield nets) Tech Rep No 208-88.

See more from authors: Luby M · Godbeer GH · Lipscomb J

References and models cited by this paper
References and models that cite this paper

Pelillo M, Torsello A. (2006). Payoff-monotonic game dynamics and the maximum clique problem. Neural computation. 18 [PubMed]

Síma J, Orponen P. (2003). General-purpose computation with neural networks: a survey of complexity theoretic results. Neural computation. 15 [PubMed]

This website requires cookies and limited processing of your personal data in order to function. By continuing to browse or otherwise use this site, you are agreeing to this use. See our Privacy policy and how to cite and terms of use.