ISSN:
1573-7470
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Connectionists models are currently being investigated actively by many researchers in artificial intelligence, information theory and computational neuroscience. These networks have been shown to be applicable to a wide range of domains such as content addressable memories, semantic nets, computer vision, natural language parsing, speech recognition, and approximation schemes for difficult optimization problems. In this paper, we address several basic problems related to the computational complexity of discrete Hopfield nets (connectionist networks with symmetric connections).
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01530937
Permalink