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

• 作 者: 张钹 张铃
• 机 构: Dept.of Computer Science and Technology Tsinghua University,Beijing 100084,Dept.of Mathematics,Anqin
• 出 处: Journal of Computer Science and Technology
• 发表日期: 1993年04期
• 关键词: Feedback Complexity Recognition layered exponential associative Probability conv

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

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