Degree Discipline
Degree Level
Year
1 Matching Results
Results open in a new window/tab.
Results:
1 - 1 of
1
Computational Complexity of Hopfield Networks
There are three main results in this dissertation. They are PLS-completeness of discrete Hopfield network convergence with eight different restrictions, (degree 3, bipartite and degree 3, 8-neighbor mesh, dual of the knight's graph, hypercube, butterfly, cube-connected cycles and shuffle-exchange), exponential convergence behavior of discrete Hopfield network, and simulation of Turing machines by discrete Hopfield Network.
Date:
August 1998
Creator:
Tseng, Hung-Li
System:
The UNT Digital Library