Computational limitations on training sigmoid neural networks

https://doi.org/10.1016/0020-0190(93)90064-GGet rights and content

First page preview

First page preview
Click to open first page preview
View PDF

References (4)

  • A. Blum et al.

    Training a 3-node neural network is NP-complete

  • M.R. Garey et al.

    Computers and Intractability: A Guide to the Theory of NP-Completeness

    (1979)
There are more references available in the full text version of this article.

Cited by (0)

∗

The author gratefully acknowledges the support of Bundesministerium für Forschung und Technologie grant 011N102C/2. The author takes the responsibility for the content.

View full text
Copyright © 1993 Published by Elsevier B.V.