The Complexity of Recognition in the Single-Layered PLN Network with Feedback Connections

摘要

Regarding a single-layered PLN network with feedback connections as an associative memory network,the complexity of recognitions is discussed.We have the main result:if the size of the network N is m,then the complexity of recognition is an exponential function of m.The necessary condition under which the complexity of recognition is polynomial is given.