Citation Relationships

Legends: Link to a Model Reference cited by multiple papers


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

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 Comput 18:1215-58 [Journal] [PubMed]
Síma J, Orponen P (2003) General-purpose computation with neural networks: a survey of complexity theoretic results. Neural Comput 15:2727-78 [Journal] [PubMed]
(2 refs)