Complexity Issues in Discrete Hopfield NetworksPatrik Floréen, and Pekka Orponen: Complexity Issues in Discrete Hopfield Networks. Report A-1994-4, Department of Computer Science, University of Helsinki, 1994. 54 pages. <http://www.cs.helsinki.fi/TR/A-1994/4> Full paper: gzip'ed Postscript file AbstractWe survey some aspects of the computational complexity theory of discrete-time and discrete-state Hopfield networks. The emphasis is on topics that are not adequately covered by the existing survey literature, most significantly:
Index Terms
Categories and Subject Descriptors:
General Terms: Additional Key Words and Phrases: |
Online Publications of Department of Computer Science, Anna Pienimäki