{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T17:17:40Z","timestamp":1771003060047,"version":"3.50.1"},"reference-count":50,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993,1]]},"DOI":"10.1016\/s0893-6080(09)80009-9","type":"journal-article","created":{"date-parts":[[2009,2,26]],"date-time":"2009-02-26T10:45:55Z","timestamp":1235645155000},"page":"997-1010","source":"Crossref","is-referenced-by-count":72,"title":["Constructive higher-order network that is polynomial time"],"prefix":"10.1016","volume":"6","author":[{"given":"Nicholas J.","family":"Redding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Kowalczyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Downs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0893-6080(09)80009-9_bib1","series-title":"ICS Rep. 8901","article-title":"Dynamic node creation in backpropagation networks","author":"Ash","year":"1989"},{"issue":"1","key":"10.1016\/S0893-6080(09)80009-9_bib2","first-page":"181","article-title":"Review of Neural network design and the complexity of learning","volume":"2","author":"Baum","year":"1991","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/S0893-6080(09)80009-9_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\/S0893-6080(09)80009-9_bib4","series-title":"Linear programing and network flows","author":"Bazaraa","year":"1990"},{"key":"10.1016\/S0893-6080(09)80009-9_bib5","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0893-6080(05)80010-3","article-title":"Training a 3-node neural network is NP-complete","volume":"5","author":"Blum","year":"1992","journal-title":"Neural Networks"},{"key":"10.1016\/S0893-6080(09)80009-9_bib6","series-title":"Introduction to approximation theory","author":"Cheney","year":"1982"},{"key":"10.1016\/S0893-6080(09)80009-9_bib7","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/PGEC.1965.264137","article-title":"Geometrical and statistical properties of systems of linear inequalities with applications to pattern recognition","volume":"EC-14","author":"Cover","year":"1965","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"10.1016\/S0893-6080(09)80009-9_bib8","first-page":"877","article-title":"Large automatic learning, rule extraction, and generalization","volume":"1","author":"Denker","year":"1987","journal-title":"Complex Systems"},{"key":"10.1016\/S0893-6080(09)80009-9_bib9","first-page":"524","article-title":"The cascade-correlation learning architecture","volume":"2","author":"Fahlman","year":"1990"},{"issue":"2","key":"10.1016\/S0893-6080(09)80009-9_bib10","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1162\/neco.1990.2.2.198","article-title":"The upstart algorithm: A method for constructing and training feedforward neural networks","volume":"2","author":"Frean","year":"1990","journal-title":"Neural Computation"},{"key":"10.1016\/S0893-6080(09)80009-9_bib11","unstructured":"Frean, M. (1992). Personal communication."},{"key":"10.1016\/S0893-6080(09)80009-9_bib12","doi-asserted-by":"crossref","first-page":"4972","DOI":"10.1364\/AO.26.004972","article-title":"Learning, invariance, and generalization in higher-order neural networks","volume":"26","author":"Giles","year":"1987","journal-title":"Applied Optics"},{"key":"10.1016\/S0893-6080(09)80009-9_bib13","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1209\/0295-5075\/12\/3\/003","article-title":"A growth algorithm for neural network decision trees","volume":"12","author":"Golea","year":"1990","journal-title":"Europhysics Letters"},{"key":"10.1016\/S0893-6080(09)80009-9_bib14","first-page":"533","article-title":"Meiosis networks","volume":"2","author":"Hanson","year":"1990"},{"key":"10.1016\/S0893-6080(09)80009-9_bib15","first-page":"177","article-title":"Comparing biases for minimal network construction with back-propagation","volume":"1","author":"Hanson","year":"1989"},{"key":"10.1016\/S0893-6080(09)80009-9_bib16","series-title":"Introduction to the theory of neural computation","author":"Hertz","year":"1991"},{"issue":"2","key":"10.1016\/S0893-6080(09)80009-9_bib17","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1162\/neco.1990.2.2.188","article-title":"Generalizing smoothness constraints from discrete samples","volume":"2","author":"Ji","year":"1990","journal-title":"Neural Computation"},{"key":"10.1016\/S0893-6080(09)80009-9_bib18","series-title":"Neural network design and the complexity of learning","author":"Judd","year":"1990"},{"key":"10.1016\/S0893-6080(09)80009-9_bib19","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1109\/PGEC.1965.264254","article-title":"Chebyshev approximation and threshold functions","volume":"EC-14","author":"Kaplan","year":"1965","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"10.1016\/S0893-6080(09)80009-9_bib20","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/S0893-6080(09)80009-9_bib21","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0375-9601(87)90371-9","article-title":"Information capacity of outer product neural networks","volume":"124","author":"Keeler","year":"1987","journal-title":"Physics Letters A"},{"issue":"2","key":"10.1016\/S0893-6080(09)80009-9_bib22","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1051\/jphys:01990005102014500","article-title":"Neural networks with many neuron interactions","volume":"51","author":"Kohring","year":"1990","journal-title":"Journal de Physique"},{"key":"10.1016\/S0893-6080(09)80009-9_bib23","first-page":"40","article-title":"Efficient parallel learning algorithms for neural networks","volume":"1","author":"Kramer","year":"1989"},{"key":"10.1016\/S0893-6080(09)80009-9_bib24","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1109\/PGEC.1966.264495","article-title":"On the threshold order of a Boolean function","volume":"EC-15","author":"Krishnan","year":"1966","journal-title":"IEEE Transactions on Electronic Computers"},{"key":"10.1016\/S0893-6080(09)80009-9_bib25","first-page":"598","article-title":"Optimal brain damage","volume":"2","author":"LeCun","year":"1990"},{"key":"10.1016\/S0893-6080(09)80009-9_bib26","first-page":"276","article-title":"Machine learning using a higher order correlation network","volume":"22D","author":"Lee","year":"1986","journal-title":"Physica"},{"key":"10.1016\/S0893-6080(09)80009-9_bib27","series-title":"Theory and problems of linear algebra. Schaum's outline series","author":"Lipschutz","year":"1968"},{"key":"10.1016\/S0893-6080(09)80009-9_bib28","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1209\/0295-5075\/11\/6\/001","article-title":"Convergence theorem for sequential learning in two layer perceptrons","volume":"11","author":"Marchand","year":"1990","journal-title":"Europhysics Letters"},{"issue":"12","key":"10.1016\/S0893-6080(09)80009-9_bib29","doi-asserted-by":"crossref","first-page":"2191","DOI":"10.1088\/0305-4470\/22\/12\/019","article-title":"Learning in feedforward layered networks: The tiling algorithm","volume":"22","author":"Mezard","year":"1989","journal-title":"Journal of Physics: A: Mathematical and General"},{"key":"10.1016\/S0893-6080(09)80009-9_bib30","series-title":"Perceptrons","author":"Minsky","year":"1988"},{"key":"10.1016\/S0893-6080(09)80009-9_bib31","first-page":"107","article-title":"Skeletonization: A technique for trimming the fat from a network via relevance assessment","volume":"1","author":"Mozer","year":"1989"},{"issue":"1","key":"10.1016\/S0893-6080(09)80009-9_bib32","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1142\/S0129065789000463","article-title":"Study of a growth algorithm for a feedforward network","volume":"1","author":"Nadal","year":"1989","journal-title":"International Journal of Neural Systems"},{"key":"10.1016\/S0893-6080(09)80009-9_bib33","series-title":"Learning machines","author":"Nilsson","year":"1965"},{"issue":"2","key":"10.1016\/S0893-6080(09)80009-9_bib34","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1109\/72.125865","article-title":"Translation, rotation, and scale invariant pattern recognition by high-order neural networks and moment classifiers","volume":"3","author":"Perantonis","year":"1992","journal-title":"IEEE Transactions on Neural Networks"},{"key":"10.1016\/S0893-6080(09)80009-9_bib35","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF00337115","article-title":"Long term memory storage capacity of multiconnected neural networks","volume":"54","author":"Peretto","year":"1986","journal-title":"Biological Cybernetics"},{"key":"10.1016\/S0893-6080(09)80009-9_bib36","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1209\/0295-5075\/4\/8\/001","article-title":"High-order neural networks: Information storage without errors","volume":"4","author":"Personnaz","year":"1987","journal-title":"Europhysics Letters"},{"key":"10.1016\/S0893-6080(09)80009-9_bib37","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02281970","article-title":"On optimal nonlinear associative recall","volume":"19","author":"Poggio","year":"1975","journal-title":"Biological Cybernetics"},{"key":"10.1016\/S0893-6080(09)80009-9_bib38","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0893-6080(88)90017-2","article-title":"Higher order associative memories and their optical implementation","volume":"1","author":"Psaltis","year":"1988","journal-title":"Neural Networks"},{"key":"10.1016\/S0893-6080(09)80009-9_bib39","series-title":"Ph.D. Thesis","article-title":"Some aspects of representation and learning in artificial neural networks","author":"Redding","year":"1991"},{"key":"10.1016\/S0893-6080(09)80009-9_bib40","first-page":"25","article-title":"Higher order separability and minimal hidden unit fan-in","volume":"vol. 1","author":"Redding","year":"1991"},{"key":"10.1016\/S0893-6080(09)80009-9_bib41","first-page":"923","article-title":"Constructive learning by specialisation","volume":"vol. 2","author":"Refenes","year":"1991"},{"key":"10.1016\/S0893-6080(09)80009-9_bib42","first-page":"689","article-title":"Rapid training of higher-order neural networks for invarient pattern recognition","volume":"vol. 1","author":"Reid","year":"1989"},{"key":"10.1016\/S0893-6080(09)80009-9_bib43","first-page":"229","article-title":"Learning by mimimizing resources in neural networks","volume":"3","author":"Ruj\u00e1n","year":"1989","journal-title":"Complex Systems"},{"key":"10.1016\/S0893-6080(09)80009-9_bib44","first-page":"13","article-title":"The pi-sigma network: An efficient higher-order neural network for pattern classification and function approximation","volume":"vol. 1","author":"Shin","year":"1991"},{"key":"10.1016\/S0893-6080(09)80009-9_bib45","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0893-6080(91)90033-2","article-title":"Creating artificial neural networks that generalize","volume":"4","author":"Sietsma","year":"1991","journal-title":"Neural Networks"},{"key":"10.1016\/S0893-6080(09)80009-9_bib46","first-page":"501","article-title":"Third-order hopfield networks: Extensive calculations and simulations","volume":"44","author":"Sirat","year":"1990","journal-title":"Phillips Journal of Research"},{"issue":"4","key":"10.1016\/S0893-6080(09)80009-9_bib47","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1088\/0954-898X\/1\/4\/003","article-title":"Neural trees: A new tool for classification","volume":"1","author":"Sirat","year":"1990","journal-title":"Network: Computation in Neural Systems"},{"key":"10.1016\/S0893-6080(09)80009-9_bib48","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0166-218X(91)90032-R","article-title":"The threshold order of a Boolean function","volume":"31","author":"Wang","year":"1991","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0893-6080(09)80009-9_bib49","series-title":"Proceedings of 13th IMACS World Congress on Computation and Applied Mathematics","first-page":"747","article-title":"Constructive algorithms and pruning: Improving the multilayer perceptron","author":"Wynne-Jones","year":"1991"},{"key":"10.1016\/S0893-6080(09)80009-9_bib50","article-title":"Node splitting: A constructive algorithm for feed-forward neural networks","volume":"4","author":"Wynne-Jones","year":"1992"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608009800099?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608009800099?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T10:55:51Z","timestamp":1545389751000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893608009800099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":50,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["S0893608009800099"],"URL":"https:\/\/doi.org\/10.1016\/s0893-6080(09)80009-9","relation":{},"ISSN":["0893-6080"],"issn-type":[{"value":"0893-6080","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}