Steepest descent can take exponential time for symmetric connection networks

Authors:
Armin Haken;Michael Luby
Affiliations:
Univ. of Toronto, Toronto, Ont., Canada;Univ. of Toronto, Toronto, Ont., Canada
Venue:
Complex Systems
Year:
1988

Citing 0
Cited 6

On the complexity of local search

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Computational complexity of neural networks: a survey

Nordic Journal of Computing
General-purpose computation with neural networks: a survey of complexity theoretic results

Neural Computation
A Discrete-Time Quantized-State Hopfield Neural Network

Annals of Mathematics and Artificial Intelligence
The computational power of discrete hopfield nets with hidden units

Neural Computation
On the power of nodes of degree four in the local max-cut problem

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity

Quantified Score

Hi-index	0.01

Visualization

Abstract