论文信息 - On the complexity of loading shallow neural networks - 字舞流文

On the complexity of loading shallow neural networks

J. Stephen Judd | J. S. Judd | S. Judd

[1] J. S. Judd,et al. Complexity of Connectionist Learning with Various Node Functions , 1987 .

[2] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[3] Ivan Hal Sudborough,et al. Bandwidth constrained NP-Complete problems , 1981, STOC '81.

[4] David S. Johnson,et al. COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .