No document available.
Abstract :
[en] The authors study the complexity and propose an algorithm for the problem of determining, given p vectors of {-1,1}^n, all linear combinations of them which are also in {-1,1}^n. Computational results are reported. This problem corresponds to the detection of spurious states in neural networks.
Scopus citations®
without self-citations
2