Attraction radii in binary hopfield nets are hard to compute

Authors:
Patrik Floréen;Pekka Orponen
Affiliations:
Department of Computer Science, University of Helsinki, SF-00014 Finland;Department of Computer Science, University of Helsinki, SF-00014 Finland
Venue:
Neural Computation
Year:
1993

Citing 4
Cited 3

Quantifiers and approximation

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Neural Networks and Complexity Theory

MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Complexity Issues in Discrete Neurocomputing

Proceedings of the 6th International Meeting of Young Computer Scientists on Aspects and Prospects of Theoretical Computer Science

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
The Average Radius of Attraction Basin of Hopfield Neural Networks

ISNN '08 Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that it is an NP-hard problem to determine the attraction radius of a stable vector in a binary Hopfield memory network, and even that the attraction radius is hard to approximate. Under synchronous updating, the problems are already NP-hard for two-step attraction radii; direct (one-step) attraction radii can be computed in polynomial time.