See this document in CiteSeerX!

Complexity Issues in Discrete Hopfield Networks  (Make Corrections)  
Patrik Floréen, Pekka Orponen



  Home/Search   Context   Related

 
View or download:
cs.helsinki.fi/pub...eld_networks.ps.gz
cs.helsinki.fi/TR/A19...A19944.ps.gz
ohiostate.edu/pub...reen.hopfield.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  cs.helsinki.fi/resear...abstracts (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We 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: 1. the known upper and lower bounds for the convergence times of Hopfield nets (here we consider mainly worst-case results); 2. the power of Hopfield nets as general computing devices (as opposed to their applications to associative memory and optimization); 3. the... (Update)

Similar documents (at the sentence level):
15.9%:   Attraction Radii in Binary Hopfield Nets are Hard to Compute - Floréen, Orponen (1992)   (Correct)

Active bibliography (related documents):   More   All
3.1:   Computational Complexity Of Neural Networks: A Survey - Orponen (1995)   (Correct)
2.0:   Neural Networks and Complexity Theory - Orponen (1992)   (Correct)
1.9:   A Computational Taxonomy and Survey of Neural Network Models - Sima, Orponen (2001)   (Correct)

Similar documents based on text:   More   All
0.5:   Some Afterthoughts on Hopfield Networks - Sima, Orponen, Antti-Poika (1999)   (Correct)
0.3:   Multicast Time Maximization in Energy Constrained.. - Floreen, Kaski.. (2003)   (Correct)
0.2:   Neural Techniques for Combinatorial Optimization with .. - Smith, Palaniswami.. (1998)   (Correct)

BibTeX entry:   (Update)

@misc{ en-complexity,
  author = "Patrik Floréen and Pekka Orponen",
  title = "Complexity Issues in Discrete Hopfield Networks",
  url = "citeseer.ist.psu.edu/55162.html" }
Citations (may not include all citations):
4212   Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
1911   Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
1056   Introduction to the Theory of Neural Computation (context) - Hertz, Krogh et al. - 1991  ACM
773   Reducibility among combinatorial problems (context) - Karp - 1972
717   Theory of Linear and Integer Programming (context) - Schrijver - 1986  ACM
700   Self-Organization and Associative Memory (context) - Kohonen - 1989
653   Neural networks and physical systems with emergent collectiv.. (context) - Hopfield - 1982  ACM
291   A logical calculus of the ideas immanent in nervous activity (context) - McCulloch, Pitts - 1943  ACM
268   Neurons with graded response have collective computational p.. (context) - Hopfield - 1984  ACM
254   Neural computation of decisions in optimization problems (context) - Hopfield, Tank - 1985
223   The Organization of Behavior (context) - Hebb - 1949  ACM
202   The Complexity of Boolean Functions - Wegener - 1987  ACM
192   Representation of events in nerve nets and finite automata (context) - Kleene - 1956
177   Computation: Finite and Infinite Machines (context) - Minsky - 1967
167   Structural Complexity (context) - Balc'azar, D'iaz et al. - 1988
105   the computational power of neural nets - Siegelmann, Sontag - 1992
102   Neurocomputing: Foundations of Research (context) - Anderson, Rosenfeld - 1988  ACM
97   Combinatorial Theory (context) - Hall - 1986
85   Turing machines that take advice (context) - Karp, Lipton - 1982
84   How easy is local search (context) - Johnson, Papadimitriou et al. - 1988
83   Geometrical and statistical properties of systems of linear .. (context) - Cover - 1965
53   The capacity of the Hopfield associative memory (context) - McEliece, Posner et al. - 1987  ACM
44   Information processing in dynamical systems: Foundations of .. (context) - Smolensky - 1986
41   Constructing a perfect matching is in Random NC (context) - Karp, Upfal et al. - 1986  ACM   DBLP
37   general weighted threshold gates (context) - Goldmann, Hastad et al. - 1992
34   Storing infinite numbers of patterns in a spin-glass model o.. (context) - Amit, Gutfreund et al. - 1985
29   Circuit Complexity and Neural Networks (context) - Parberry - 1994  ACM
28   Correlation matrix memories (context) - Kohonen - 1972  ACM
28   Bidirectional associative memories (context) - Kosko - 1988  ACM
26   Decreasing energy functions as a tool for studying threshold.. (context) - Ch, Souli'e et al. - 1985
26   A primer on the complexity theory of neural networks (context) - Parberry - 1990
25   Collective computational properties of neural networks: New .. (context) - Personnaz, Guyon et al. - 1986
23   Recursive Neural Networks for Associative Memory (context) - Kamp, Hasler - 1990  ACM
22   Exponential transient classes of symmetric neural networks f.. (context) - Goles, Mart'inez - 1989
22   Simple local search problems that are hard to solve (context) - Schaffer, Yannakakis - 1991  ACM   DBLP
22   Neural computability (context) - Franklin, Garzon - 1990
21   the stability of the travelling salesman problem algorithm o.. (context) - Wilson, Pawley - 1988
21   Internal representations for associative memory (context) - Baum, Moody et al. - 1988
20   Convergence results in an associative memory model (context) - Koml'os, Paturi - 1988
19   A simple neural network generating an interactive memory (context) - Anderson - 1972  ACM
17   Optimal storage properties of neural network models (context) - Gardner, Derrida - 1988
17   A comparison of the computational power of neural network mo.. (context) - Hartley, Szu - 1987
16   Computational Power for Networks of Threshold Devices in an .. (context) - Lepley, Miller - 1983
16   Transient length in sequential iterations of threshold funct.. (context) - Fogelman, Goles et al. - 1983
15   Steepest descent can take exponential time for symmetric con.. (context) - Haken, Luby - 1988  ACM
14   Representation of associated data by matrix operations (context) - Kohonen, Ruohonen - 1973
13   Neurocomputing 2: Directions for Research (context) - Anderson, Pellionisz et al. - 1990
13   On characterizations of the class PSPACE/poly (context) - Balc'azar, D'iaz et al. - 1987  ACM   DBLP
12   Characteristics of sparsely encoded associative memory (context) - Amari - 1989
12   Neural and Automata Networks: Dynamical Behavior and Applica.. (context) - Goles, Mart'inez - 1990  ACM
12   Theory of majority decision elements (context) - Muroga, Toda et al. - 1961
12   Analytic theory of the ground state properties of a spin gla.. (context) - Tanaka, Edwards - 1980
12   Approximating the minimum maximal independence number (context) - Halld'orsson - 1993  ACM   DBLP
12   Connectionist Networks that Need Exponential Time to Stabili.. (context) - Haken - 1989
12   The convergence of symmetric threshold automata (context) - Ch, Olivos - 1981  DBLP
11   the convergence properties of the Hopfield model (context) - Bruck - 1990
11   Associatron --- a model of associative memory (context) - Nakano - 1972
11   Complexity issues in discrete neurocomputing (context) - Wiedermann - 1990  ACM   DBLP
9   A generalized convergence theorem for neural networks (context) - Bruck, Goodman - 1988
9   Learning in threshold networks (context) - Raghavan - 1988  ACM   DBLP
7   the computational power of discrete Hopfield nets - Orponen - 1993
7   Stability and looping in connectionist models with asymmetri.. (context) - Porat - 1989
6   Lyapunov functions associated to automata networks (context) - Goles - 1987  ACM
6   Asynchronous threshold networks (context) - Alon - 1987
6   Artificial Neural Networks: Paradigms (context) - S'anchez-Sinencio, Lau - 1992
6   Pure and Applied Math (context) - Hong, models - 1988
6   the capacity of associative memories with linear threshold f.. (context) - Dembo - 1989
5   Dynamics of positive automata networks (context) - Ch - 1985  ACM   DBLP
5   Sequential simulation of parallel iterations and application.. (context) - Tchuente - 1986  ACM   DBLP
5   the computational complexity of analyzing Hopfield nets (context) - Flor'een, Orponen - 1989
5   Studia Scientiarum Mathematicarum Hungarica (context) - Koml'os, determinant et al. - 1967
4   the computational power of probabilistic and faulty neural n.. (context) - Siegelmann - 1994
4   Linear and logarithmic capacities in associative neural netw.. (context) - Venkatesh, Psaltis - 1989
4   Information capacity of associative memories (context) - Kuh, Dickinson - 1989
3   the computational complexity of finding a connectionist mode.. (context) - Lipscomb - 1988
3   Epsilon capacity in neural networks (context) - Venkatesh - 1986
3   Evaluation of the use of the Hopfield neural network model a.. (context) - Montgomery, Kumar - 1986
2   Personal communication (context) - Kann - 1992
2   On periodical behaviour in societes with symmetric influence.. (context) - Poljak, ura - 1983
2   Computational Complexity Problems in Neural Associative Memo.. (context) - Flor'een - 1992
2   The computational complexity of the stable configuration pro.. (context) - Godbeer - 1988
2   A study on neural networks (context) - Bruck, Sanz - 1988
1   On reliable computation with formal neurons (context) - Venkatesh, Psaltis - 1992  ACM   DBLP
1   Worst-case convergence times for Hopfield memories (context) - Flor'een - 1991
1   Special issue on neural network hardware (context) - on, Networks - 1992
1   Attraction radii in Hopfield nets are hard to compute (context) - Flor'een, Orponen - 1993
1   the computational efficiency of symmetric neural networks (context) - Wiedermann - 1991
1   Theories for the synthesis of analog and discrete neural net.. (context) - Chandru, Vidyasagar et al. - 1993

Documents on the same site (http://www.cs.helsinki.fi/research/cosco/Articles/abstracts.html):   More
Constructing Computationally Efficient Bayesian Models via.. - Myllymäki, Tirri (1995)   (Correct)
Massively Parallel Case-Based Reasoning with Probabilistic.. - Myllymäki, Tirri (1994)   (Correct)
Computational Complexity Of Neural Networks: A Survey - Orponen (1995)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC