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 recognition is discussed. We have the main result: if the size of the networkN ism, then the complexity of recognition is an exponential function ofm. The necessary condition under which the complexity of recognition is polynomial is given.

[1]  Haihong Zhang,et al.  The complexity of learning algorithm in PLN network , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.

[2]  John G. Kemeny,et al.  Finite Markov chains , 1960 .

[3]  J. Stephen Judd,et al.  Neural network design and the complexity of learning , 1990, Neural network modeling and connectionism.

[4]  Alan F. Murray,et al.  International Joint Conference on Neural Networks , 1993 .

[5]  Bo Zhang,et al.  A quantitative analysis of the behaviors of the PLN network , 1992, Neural Networks.