Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Theory of linear and integer programming
Theory of linear and integer programming
The capacity of the Hopfield associative memory
IEEE Transactions on Information Theory
The complexity of Boolean functions
The complexity of Boolean functions
On characterizations of the class pspace/poly
Theoretical Computer Science
On the stability of the travelling salesman problem algorithm of Hopfield and Tank
Biological Cybernetics
On the complexity of loading shallow neural networks
Journal of Complexity - Special Issue on Neural Computation
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Neurocomputing: foundations of research
Neurocomputing: foundations of research
Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
Multilayer feedforward networks are universal approximators
Neural Networks
Crytographic limitations on learning Boolean formulae and finite automata
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Neural network design and the complexity of learning
Neural network design and the complexity of learning
Neural and automata networks: dynamical behavior and applications
Neural and automata networks: dynamical behavior and applications
Learning in threshold networks
COLT '88 Proceedings of the first annual workshop on Computational learning theory
Simple local search problems that are hard to solve
SIAM Journal on Computing
Efficient simulation of finite automata by neural nets
Journal of the ACM (JACM)
Introduction to the theory of neural computation
Introduction to the theory of neural computation
Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations
The appeal of parallel distributed processing
Parallel distributed processing: explorations in the microstructure of cognition, vol. 1
Learning and relearning in Boltzmann machines
Parallel distributed processing: explorations in the microstructure of cognition, vol. 1
Learning internal representations by error propagation
Parallel distributed processing: explorations in the microstructure of cognition, vol. 1
A logical calculus of the ideas immanent in nervous activity
Neurocomputing: foundations of research
A simple neural network generating an interactive memory
Neurocomputing: foundations of research
Complexity Results on Learning by Neural Nets
Machine Learning
Advances in neural information processing systems 2
A geometric approach to threshold circuit complexity
COLT '91 Proceedings of the fourth annual workshop on Computational learning theory
On the computational power of sigmoid versus boolean threshold circuits (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
On the computational power of neural nets
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Recursive neural networks for associative memory
Recursive neural networks for associative memory
On threshold circuits and polynomial computation
SIAM Journal on Computing
Neurocomputing (vol. 2): directions for research
Neurocomputing (vol. 2): directions for research
n&OHgr;(logn) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
Information Processing Letters
Bounds for the computational power and learning complexity of analog neural nets
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Simulating threshold circuits by majority circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Threshold circuits of bounded depth
Journal of Computer and System Sciences
Feedforward nets for interpolation and classification
Journal of Computer and System Sciences
Circuit complexity and neural networks
Circuit complexity and neural networks
Optimal Depth Neural Networks for Multiplication and Related Problems
Advances in Neural Information Processing Systems 5, [NIPS Conference]
The Power of Approximation: A Comparison of Activation Functions
Advances in Neural Information Processing Systems 5, [NIPS Conference]
On the Computational Power of Discrete Hopfield Nets
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Complexity Issues in Discrete Neurocomputing
Proceedings of the 6th International Meeting of Young Computer Scientists on Aspects and Prospects of Theoretical Computer Science
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Computation: finite and infinite machines
Computation: finite and infinite machines
Journal of the ACM (JACM)
Complexity of reachability problems for finite discrete dynamical systems
Journal of Computer and System Sciences
Predecessor existence problems for finite discrete dynamical systems
Theoretical Computer Science
Learning Deep Architectures for AI
Foundations and Trends® in Machine Learning
Survey A survey of computational complexity results in systems and control
Automatica (Journal of IFAC)
Reversible iterative graph processes
Theoretical Computer Science
| Hi-index | 0.00 |
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.