Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456 Are Hopfield Networks Faster Than Conventional Computers?
Are Hopfield Networks Faster Than
Conventional Computers?
It is shown that conventional computers can be exponentially faster
than planar Hopfield networks: although there
are planar Hopfield networks that take exponential time to
converge, a stable state of an arbitrary planar Hopfield network can be
found by a conventional computer in polynomial time.
The theory of PLS-completeness gives
strong evidence that such a separation is unlikely for nonplanar
Hopfield networks, and it is demonstrated that this is also the case
for several restricted classes of nonplanar Hopfield networks,
including those who interconnection graphs are the class of
bipartite graphs,
graphs of degree 3,
the dual of the knight's graph,
the 8-neighbor mesh,
the hypercube,
the butterfly,
the cube-connected cycles,
and the shuffle-exchange graph.
Created by Ian Parberry,
October 15, 1997. Last updated
Wed Oct 15 21:17:58 CDT 1997.