Neural networks, error-correcting codes, and polynomials over the binary n -cube
暂无分享,去创建一个
[1] M. Desu. A Selection Problem , 1970 .
[2] Eric Goles Ch.,et al. Decreasing energy functions as a tool for studying threshold networks , 1985, Discret. Appl. Math..
[3] Pierre Hansen,et al. Roof duality, complementation and persistency in quadratic 0–1 optimization , 1984, Math. Program..
[4] P. Hansen. Methods of Nonlinear 0-1 Programming , 1979 .
[5] Joseph W. Goodman,et al. A generalized convergence theorem for neural networks , 1988, IEEE Trans. Inf. Theory.
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] M. Balinski. Notes—On a Selection Problem , 1970 .
[8] J. Rhys. A Selection Problem of Shared Fixed Costs and Network Flows , 1970 .
[9] Jehoshua Bruck,et al. A study on neural networks , 1988, Int. J. Intell. Syst..
[10] H. D. Ratliff,et al. Minimum cuts and related problems , 1975, Networks.
[11] O. Antoine,et al. Theory of Error-correcting Codes , 2022 .
[12] J J Hopfield,et al. Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.
[13] Pierre Hansen,et al. Unimodular functions , 1986, Discrete Applied Mathematics.
[14] S. Louis Hakimi,et al. Cut-set matrices and linear codes (Corresp.) , 1965, IEEE Transactions on Information Theory.