Hardness of approximation of the loading problem for multi-layered feedforward neural networks

DasGupta B, Hammer B (1999)
DIMACS Center, Rutgers University.

Report | Published | English

No fulltext has been uploaded

Author
;
Publishing Year
PUB-ID

Cite this

DasGupta B, Hammer B. Hardness of approximation of the loading problem for multi-layered feedforward neural networks. DIMACS Center, Rutgers University; 1999.
DasGupta, B., & Hammer, B. (1999). Hardness of approximation of the loading problem for multi-layered feedforward neural networks. DIMACS Center, Rutgers University.
DasGupta, B., and Hammer, B. (1999). Hardness of approximation of the loading problem for multi-layered feedforward neural networks. DIMACS Center, Rutgers University.
DasGupta, B., & Hammer, B., 1999. Hardness of approximation of the loading problem for multi-layered feedforward neural networks, DIMACS Center, Rutgers University.
B. DasGupta and B. Hammer, Hardness of approximation of the loading problem for multi-layered feedforward neural networks, DIMACS Center, Rutgers University, 1999.
DasGupta, B., Hammer, B.: Hardness of approximation of the loading problem for multi-layered feedforward neural networks. DIMACS Center, Rutgers University (1999).
DasGupta, B., and Hammer, Barbara. Hardness of approximation of the loading problem for multi-layered feedforward neural networks. DIMACS Center, Rutgers University, 1999.
This data publication is cited in the following publications:
This publication cites the following data publications:

Export

0 Marked Publications

Open Data PUB

Search this title in

Google Scholar