On the complexity of recognizing a set of vectors by a neuron |
| |
Authors: | Yu S Okulovskiĭ V Yu Popov |
| |
Institution: | 1.Ural State University,Ekaterinburg,Russia |
| |
Abstract: | We consider the problems connected with the computational abilities of a neuron. The orderings of finite subsets of real vectors
associated with neural computing are studied. We construct a lattice of such orderings and study some its properties. The
interrelation between the orders on the sets and the neuron implementation of functions defined on these sets is derived.
We prove the NP-hardness of “The Shortest Vector” problem and represent the relationship of the problem with neural computing. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |