{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T09:26:34Z","timestamp":1749720394093},"reference-count":30,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Networks"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1016\/0893-6080(94)90089-2","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T03:25:55Z","timestamp":1051241155000},"page":"1413-1426","source":"Crossref","is-referenced-by-count":16,"title":["On the node complexity of neural networks"],"prefix":"10.1016","volume":"7","author":[{"given":"Bill G.","family":"Horne","sequence":"first","affiliation":[]},{"given":"Don R.","family":"Hush","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0893-6080(94)90089-2_BIB1","series-title":"Proceedings of the IEEE Annual Symposium on the Foundations of Computer Science","first-page":"580","article-title":"A note on the power of threshold circuits","author":"Allender","year":"1989"},{"issue":"2","key":"10.1016\/0893-6080(94)90089-2_BIB2","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1145\/103516.103523","article-title":"Efficient simulation of finite automata by neural nets","volume":"38","author":"Alon","year":"1991","journal-title":"Journal of the Association of Computing Machinery"},{"key":"10.1016\/0893-6080(94)90089-2_BIB3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1162\/neco.1989.1.1.151","article-title":"What size net gives valid generalization?","volume":"1","author":"Baum","year":"1989","journal-title":"Neural Computation"},{"key":"10.1016\/0893-6080(94)90089-2_BIB4","first-page":"1183","article-title":"The problem of learning long-term dependencies in recurrent networks","volume":"Vol. 3","author":"Bengio","year":"1993"},{"key":"10.1016\/0893-6080(94)90089-2_BIB5","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BF01744431","article-title":"Parity, circuits, and the polynomial time hierarchy","volume":"17","author":"Furst","year":"1984","journal-title":"Mathematical Systems Theory"},{"key":"10.1016\/0893-6080(94)90089-2_BIB6","article-title":"Recurrent neural networks: A functional approach","author":"Horne","year":"1993"},{"key":"10.1016\/0893-6080(94)90089-2_BIB7","doi-asserted-by":"crossref","unstructured":"Horne, B., & Hush, D. (in press). Bounds on the complexity of recurrent neural network implementations of finite state machines. In J. D. Cowen, G. Tesaura, & J. Alspector (Eds.), Advances in neural information processing systems 6 (pp. 359\u2013366). San Mateo, CA: Morgan Kaufmann.","DOI":"10.1016\/0893-6080(95)00095-X"},{"key":"10.1016\/0893-6080(94)90089-2_BIB8","series-title":"Proceedings of the Sixth ACM Workshop on Computational Learning Theory","first-page":"137","article-title":"On the power of sigmoid neural networks","author":"Kilian","year":"1993"},{"issue":"2","key":"10.1016\/0893-6080(94)90089-2_BIB9","first-page":"91","article-title":"Circuits using threshold elements","volume":"17","author":"Lupanov","year":"1972","journal-title":"Soviet Physics\u2014Doklady"},{"key":"10.1016\/0893-6080(94)90089-2_BIB10","first-page":"109","article-title":"The synthesis of circuits from threshold elements","volume":"26","author":"Lupanov","year":"1973","journal-title":"Problemy Kibernetiki"},{"key":"10.1016\/0893-6080(94)90089-2_BIB11","series-title":"Tech. Rep.","article-title":"Neural nets with superlinear VC-dimension","author":"Maass","year":"1993"},{"key":"10.1016\/0893-6080(94)90089-2_BIB12","series-title":"Threshold logic and its applications","author":"Muroga","year":"1971"},{"issue":"1","key":"10.1016\/0893-6080(94)90089-2_BIB13","first-page":"163","article-title":"Synthesis of circuits from threshold logic elements","volume":"5","author":"Ne\u010diporuk","year":"1964","journal-title":"Soviet Mathematics\u2014Doklady"},{"issue":"1","key":"10.1016\/0893-6080(94)90089-2_BIB14","first-page":"35","article-title":"The synthesis of networks from threshold elements\u2014Part I","volume":"7","author":"Ne\u010diporuk","year":"1964","journal-title":"Automation Express"},{"issue":"2","key":"10.1016\/0893-6080(94)90089-2_BIB15","first-page":"27","article-title":"The synthesis of networks from threshold elements\u2014Part II","volume":"7","author":"Ne\u010diporuk","year":"1964","journal-title":"Automation Express"},{"key":"10.1016\/0893-6080(94)90089-2_BIB16","series-title":"Proceedings of 2nd Conference on Structure in Complexity Theory","first-page":"118","article-title":"On threshold circuits and polynomial computation","author":"Reif","year":"1987"},{"key":"10.1016\/0893-6080(94)90089-2_BIB17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/j.1538-7305.1949.tb03624.x","article-title":"The synthesis of two-terminal switching circuits","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell System Technical Journal"},{"key":"10.1016\/0893-6080(94)90089-2_BIB18","article-title":"Neural networks are universal computing devices","author":"Siegelmann","year":"1991"},{"key":"10.1016\/0893-6080(94)90089-2_BIB19","series-title":"Proceedings of the Fifth ACM Workshop on Computational Learning Theory","first-page":"440","article-title":"On the computational power of neural networks","author":"Siegelmann","year":"1992"},{"key":"10.1016\/0893-6080(94)90089-2_BIB20_1","series-title":"Theoretical Computer Science","article-title":"Analog computation via neural networks","author":"Siegelmann","year":"1994"},{"key":"10.1016\/0893-6080(94)90089-2_BIB20_2","series-title":"Second Israel Symposium on Theory of Computing ans Systems","year":"1993"},{"key":"10.1016\/0893-6080(94)90089-2_BIB21","series-title":"Algorithms, software, architecture (Proceedings of IFIP 12th World Computer Congress)","first-page":"329","article-title":"The complexity of language recognition by neural networks","author":"Siegelmann","year":"1992"},{"key":"10.1016\/0893-6080(94)90089-2_BIB22","series-title":"Tech. Rep.","article-title":"On the power of threshold circuits with small weights","author":"Siu","year":"1990"},{"key":"10.1016\/0893-6080(94)90089-2_BIB23","series-title":"Tech. Rep.","article-title":"Computing with almost optimal size threshold circuits","author":"Siu","year":"1990"},{"key":"10.1016\/0893-6080(94)90089-2_BIB24","series-title":"Tech. Rep.","article-title":"Depth-size tradeoffs for neural computation","author":"Siu","year":"1990"},{"issue":"1","key":"10.1016\/0893-6080(94)90089-2_BIB25","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1109\/TC.1968.5008873","article-title":"A partitioning method for combinational synthesis","volume":"C-17","author":"Smith","year":"1968","journal-title":"IEEE Transactions on Computers"},{"key":"10.1016\/0893-6080(94)90089-2_BIB26","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1162\/neco.1989.1.4.470","article-title":"Sigmoids distinguish more efficiently than heavisides","volume":"1","author":"Sontag","year":"1989","journal-title":"Neural Computation"},{"key":"10.1016\/0893-6080(94)90089-2_BIB27","first-page":"619","article-title":"Learning algorithms for connectionist networks: Applied gradient methods of nonlinear optimization","volume":"Vol. 2","author":"Watrous","year":"1987"},{"key":"10.1016\/0893-6080(94)90089-2_BIB28","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1109\/PGEC.1963.263657","article-title":"Bounds on threshold gate realizability","volume":"EC-12","author":"Winder","year":"1963","journal-title":"IEEE Transactions on Electronic Computers"},{"issue":"4","key":"10.1016\/0893-6080(94)90089-2_BIB29","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/T-C.1970.222921","article-title":"Threshold logic asymptotes","volume":"C-19","author":"Winder","year":"1970","journal-title":"IEEE Transactions on Computers"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0893608094900892?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0893608094900892?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T19:27:21Z","timestamp":1553282841000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0893608094900892"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":30,"journal-issue":{"issue":"9","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0893608094900892"],"URL":"https:\/\/doi.org\/10.1016\/0893-6080(94)90089-2","relation":{},"ISSN":["0893-6080"],"issn-type":[{"value":"0893-6080","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}