%0 Journal Article
%T The complexity of recognition in the single-layered PLN network with feedback connections<br>The Complexity of Recognition in the Single-Layered PLN Network with Feedback Connections
%A Bo Zhang
%A Ling Zhang
%A <br>Zhang Bo
%A Zhang Ling
%J 计算机科学技术学报
%D 1993
%I 
%X Regarding a single-layered PLN network with feedback connections as an associative memory network,the complexity of recognition 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.
%K PLN network
%K stable state
%K associative memory network
%K Markov chain
%K transition matrix
%K complexity of recognition<br>PLN网络
%K 反馈连接
%K 复杂性识别
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=D75E440BFE9762B1634F32DD54607D41&yid=D418FDC97F7C2EBA&vid=5D311CA918CA9A03&iid=E158A972A605785F&sid=E3094127AA4ABC1A&eid=4AD4BA66429F5627&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=2