Pekka Orponen  Home/Search
Context Related
| math.jyu.fi/~orponen/papers...nncomp.ps cs.helsinki.fi/pub...ks:_a_survey.ps.gz cs.helsinki.fi/TR/O/O19945.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: math.jyu.fi/~orpon...publications (more) From: cs.helsinki.fi/resear...abstracts (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . We survey some of the central results in the complexity theory of discrete neural networks, with pointers to the literature. Our main emphasis is on the computational power of various acyclic and cyclic network models, but we also discuss briefly the complexity aspects of synthesizing networks from examples of their behavior. CR Classification: F.1.1 [Computation by Abstract Devices]: Models of Computation---neural networks, circuits; F.1.3 [Computation by Abstract Devices ]: Complexity... (Update)
Context of citations to this paper: More
.... Alur et al. 1995] hybrid systems) Bournez and Cosnard, 1996] Moore, 1998] Turing machine as dynamical systems) and [Orponen, 1994] (recurrent neural networks) Some open problems related to the computational complexity of control questions are proposed in...
.... networks has intimate connections to the classical theory of Boolean circuit complexity [53] and is surveyed brie y in the articles [36, 40], and at greater depth in the books [41, 43, 52] 2. BASIC NOTIONS AND RESULTS With the brief exception of Section 6 on continuous time...
Cited by: More
Energy-Based Computation with Symmetric Hopfield Nets - Sima (Correct)
A Computational Taxonomy and Survey of Neural Network Models - Sima, Orponen (2001) (Correct)
The Computational Theory of Neural Networks - Sima (2000) (Correct)
Similar documents (at the sentence level):
45.1%: Neural Networks and Complexity Theory - Orponen (1992) (Correct)
Active bibliography (related documents): More All
5.4: Computational Complexity Of Neural Networks: A Survey - Orponen (1994) (Correct)
3.1: Complexity Issues in Discrete Hopfield Networks - Floréen, Orponen (Correct)
1.0: Computing with Truly Asynchronous Threshold Logic Networks - Orponen (1995) (Correct)
Similar documents based on text: More All
0.3: A New Heuristic for Placing Absolute P-Centers on a Cyclic.. - Damle Sule Department (Correct)
0.1: Efficient Algorithms for Sampling and Clustering of Large.. - Orponen, Schaeffer (Correct)
0.1: Optimisation, block designs and No Free Lunch theorems - Griffiths, Orponen (Correct)
Related documents from co-citation: More All
6: Circuit Complexity and Neural Networks (context) - Parberry - 1994
6: Analog computation via neural networks - Siegelmann, Sontag - 1994
5: A primer on the complexity theory of neural networks (context) - Parberry - 1990
BibTeX entry: (Update)
Orponen, P. Computational complexity of neural networks: A survey. Nordic Journal of Computing 1 (1994), 94--110. http://citeseer.ist.psu.edu/article/orponen95computational.html More
@article{ orponen94computational,
author = "Pekka Orponen",
title = "Computational complexity of neural networks: a survey",
journal = "Nordic Journal of Computing",
volume = "1",
number = "1",
month = "Spring",
pages = "94--110",
year = "1994",
url = "citeseer.ist.psu.edu/article/orponen95computational.html" }
Citations (may not include all citations):1491 Learning internal representations by error propagation (context) - Rumelhart, Hinton et al. ACM
1056 Introduction to the Theory of Neural Computation (context) - Hertz, Krogh et al. - 1991 ACM
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
625 Parallel Distributed Processing: Explorations in the Microst.. (context) - McClelland, Rumelhart - 1986
625 Parallel Distributed Processing: Explorations in the Microst.. (context) - Rumelhart, McClelland - 1986
357 Approximation by superposition of a sigmoidal function (context) - Cybenko - 1989
291 A logical calculus of the ideas immanent in nervous activity (context) - McCulloch, Pitts - 1943 ACM
254 Neural computation of decisions in optimization problems (context) - Hopfield, Tank - 1985
235 the approximate realization of continuous mappings by neural.. (context) - Funahashi - 1989
228 Simulated Annealing and Boltzmann Machines (context) - Aarts, Korst - 1989
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
138 Learning and relearning in Boltzmann machines (context) - Hinton, Sejnowski
115 Separating the polynomial-time hierarchy by oracles (context) - Yao - 1985
105 the computational power of neural nets - Siegelmann, Sontag - 1992
103 Almost optimal lower bounds for small depth circuits - Hastad - 1989 ACM DBLP
102 Neurocomputing: Foundations of Research (context) - Anderson, Rosenfeld - 1988 ACM
101 Threshold Logic and Its Applications (context) - Muroga - 1971
90 Neural Network Design and the Complexity of Learning (context) - Judd - 1990 ACM
75 and the polynomial-time hierarchy (context) - Furst, Saxe et al. - 1984
64 Feedforward nets for interpolation and classification (context) - Sontag - 1992 ACM DBLP
53 The capacity of the Hopfield associative memory (context) - McEliece, Posner et al. - 1987 ACM
51 On threshold circuits and polynomial computation - Reif, Tate - 1992 ACM DBLP
44 Bounds for the computational power and learning complexity o.. - Maass - 1993 ACM DBLP
37 Efficient simulation of finite automata by neural nets (context) - Alon, Dewdney et al. - 1991 ACM DBLP
37 general weighted threshold gates (context) - Goldmann, Hastad et al. - 1992
36 the computational power of sigmoid versus Boolean threshold .. (context) - Maass, Schnitger et al. - 1991
34 Storing infinite numbers of patterns in a spin-glass model o.. (context) - Amit, Gutfreund et al. - 1985
32 the size of weights for threshold gates - Hastad
31 the power of threshold circuits with small weights (context) - Siu, Bruck - 1991
29 Circuit Complexity and Neural Networks (context) - Parberry - 1994 ACM
29 Complexity results on learning by neural nets - Lin, Vitter - 1991 ACM DBLP
28 Correlation matrix memories (context) - Kohonen - 1972 ACM
27 Neural computation of arithmetic functions (context) - Siu, Bruck - 1990
26 A primer on the complexity theory of neural networks (context) - Parberry - 1990
26 Decreasing energy functions as a tool for studying threshold.. (context) - Goles, Fogelman et al. - 1985
25 Collective computational properties of neural networks: New .. (context) - Personnaz, Guyon et al. - 1986
25 On Connectionist Models of Natural Language Processing (context) - Pollack - 1987
23 the complexity of loading shallow neural networks (context) - Judd - 1988
23 The power of approximating: A comparison of activation funct.. - DasGupta, Schnitger - 1993
23 Recursive Neural Networks for Associative Memory (context) - Kamp, Hasler - 1990 ACM
22 Neural computability (context) - Franklin, Garzon - 1990
22 Simple local search problems that are hard to solve (context) - Schaffer, Yannakakis - 1991 ACM DBLP
22 Exponential transient classes of symmetric neural networks f.. (context) - Goles, Mart'inez - 1989
21 the stability of the travelling salesman problem algorithm o.. (context) - Wilson, Pawley - 1988
19 A simple neural network generating an interactive memory (context) - Anderson - 1972 ACM
19 Simulating threshold circuits by majority circuits - Goldmann, Karpinski - 1993 ACM DBLP
17 A comparison of the computational power of neural networks (context) - Hartley, Szu - 1987
16 Computational power for networks of threshold devices in an .. (context) - Lepley, Miller - 1983
16 the size of weights required for linear-input switching func.. (context) - Myhill, Kautz - 1961
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
15 Neural and Automata Networks (context) - Goles, Mart'inez - 1990
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 Theory of majority decision elements (context) - Muroga, Toda et al. - 1961
12 The convergence of symmetric threshold automata (context) - Goles, Olivos - 1981 DBLP
12 the power of small-depth threshold circuits (context) - Hastad, Goldmann - 1991
12 the Computational Complexity of Finding Stable State Vectors.. (context) - Godbeer, Lipscomb et al. - 1988
12 Connectionist networks that need exponential time to stabili.. (context) - Haken - 1989
11 Complexity issues in discrete neurocomputing (context) - Wiedermann - 1990 ACM DBLP
11 the convergence properties of the Hopfield model (context) - Bruck - 1990
11 Associatron --- a model of associative memory (context) - Nakano - 1972
10 lower bounds on the size of depth-3 threshold circuits with .. - Razborov, Wigderson et al. - 1993
10 Neural computability II (context) - Garzon, Franklin - 1989
10 Relating Boltzmann machines to conventional models of comput.. (context) - Parberry, Schnitger - 1989 ACM DBLP
9 Learning in threshold networks (context) - Raghavan - 1988 ACM DBLP
9 Automata Networks in Computer Science: Theory and Applicatio.. (context) - Fogelman, Robert et al. - 1987 ACM
8 The Computational and Learning Complexity of Neural Networks.. (context) - Parberry
7 Stability and looping in connectionist models with asymmetri.. (context) - Porat - 1989
7 the computational power of discrete Hopfield nets - Orponen - 1993
6 Asynchronous threshold networks (context) - Alon - 1985
6 the capacity of associative memories with linear threshold f.. (context) - Dembo - 1989
6 Pure and Applied Math (context) - Hong - 1988
5 the computational complexity of analyzing Hopfield nets (context) - Flor'een, Orponen - 1989
5 Global dynamics in neural networks (context) - Franklin, Garzon - 1989
4 A geometric approach to threshold circuit complexity (context) - Roychowdhury, Siu et al. - 1991 ACM DBLP
4 Linear and logarithmic capacities in associative neural netw.. (context) - Venkatesh, Psaltis - 1989
4 Center for Research in Parallel and Distributed Computing (context) - Parberry, Complexity - 1991
4 Information capacity of associative memories (context) - Kuh, Dickinson - 1989
4 Analog neural networks of limited precision I: Computing wit.. (context) - Obradovic, Parberry - 1990 DBLP
3 Multilayer feedforward nets are universal approximators (context) - Hornik, Stinchcombe et al. - 1989
3 Training a 3-node neural network in NP-complete (context) - Blum, Rivest - 1992 ACM
3 Global dynamics in neural nets II (context) - Garzon, Franklin - 1989
2 Priciples of Neurodynamics (context) - Rosenblatt - 1962
1 Optimal depth neural networks for multiplication and related.. (context) - Siu, Roychowdhury - 1993 ACM DBLP
1 Attraction radii in binary Hopfield nets are hard to compute (context) - Flor'een, Orponen - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.math.jyu.fi/~orponen/publications.html): More
Computing with Truly Asynchronous Threshold Logic Networks - Orponen (1995) (Correct)
A Survey of Continuous-Time Computation Theory - Orponen (1997) (Correct)
Programming the Harmonium - Myllymäki, Orponen (1991) (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