{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T11:20:56Z","timestamp":1773314456769,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"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":[[1992,11]]},"DOI":"10.1016\/s0893-6080(05)80093-0","type":"journal-article","created":{"date-parts":[[2005,10,19]],"date-time":"2005-10-19T17:38:58Z","timestamp":1129743538000},"page":"971-977","source":"Crossref","is-referenced-by-count":15,"title":["Classes of feedforward neural networks and their circuit complexity"],"prefix":"10.1016","volume":"5","author":[{"given":"John S.","family":"Shawe-Taylor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin H.G.","family":"Anthony","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Kern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0893-6080(05)80093-0_bib1","series-title":"Handbook of Theoretical Computer Science","first-page":"758","article-title":"The complexity of finite functions","author":"Boppana","year":"1990"},{"key":"10.1016\/S0893-6080(05)80093-0_bib2","first-page":"539","article-title":"Monotone circuits for connectivity require super-logarithmic depth","author":"Karchmer","year":"1988"},{"key":"10.1016\/S0893-6080(05)80093-0_bib3","first-page":"81","article-title":"Lattices, M\u00f6bius functions and communication complexity","author":"Lov\u00e1sz","year":"1988"},{"key":"10.1016\/S0893-6080(05)80093-0_bib4","volume":"Vol. 1 and 2","author":"McClelland","year":"1986"},{"key":"10.1016\/S0893-6080(05)80093-0_bib5","first-page":"19","article-title":"Learning in threshold networks","author":"Raghavan","year":"1988"},{"key":"10.1016\/S0893-6080(05)80093-0_bib6","article-title":"The complexity of boolean functions","author":"Wegener","year":"1987"}],"container-title":["Neural Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608005800930?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0893608005800930?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T18:20:10Z","timestamp":1548094810000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0893608005800930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["S0893608005800930"],"URL":"https:\/\/doi.org\/10.1016\/s0893-6080(05)80093-0","relation":{},"ISSN":["0893-6080"],"issn-type":[{"value":"0893-6080","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}