{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T10:29:00Z","timestamp":1687602540301},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1016\/0020-0190(93)90202-k","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"85-87","source":"Crossref","is-referenced-by-count":25,"title":["Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions"],"prefix":"10.1016","volume":"46","author":[{"given":"Ingo","family":"Wegener","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90202-K_BIB1","article-title":"Explicit constructions for depth-2 majority circuits for comparison and addition","author":"Alon","year":"1991","journal-title":"IBM Research Rept. RJ 8300"},{"key":"10.1016\/0020-0190(93)90202-K_BIB2","first-page":"2","article-title":"Majority gates vs. general weighted threshold gates","author":"Goldmann","year":"1992","journal-title":"Proc. 7th Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0020-0190(93)90202-K_BIB3","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/SFCS.1987.59","article-title":"Threshold circuits of bounded depth","author":"Hajnal","year":"1987","journal-title":"Proc. 28th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90202-K_BIB4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/3-540-55706-7_4","article-title":"On small depth threshold circuits","volume":"621","author":"Razborov","year":"1992"},{"key":"10.1016\/0020-0190(93)90202-K_BIB5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0404038","article-title":"On the power of threshold circuits with small weights","volume":"4","author":"Siu","year":"1991","journal-title":"SIAM J. Discrete Methods"},{"key":"10.1016\/0020-0190(93)90202-K_BIB6","doi-asserted-by":"crossref","unstructured":"K.Y. Siu, J. Bruck, T. Kailath and T. Hofmeister, Depth-efficient neural networks for division and related problems, IEEE Trans. Inform. Theory, to appear.","DOI":"10.1109\/18.256501"},{"key":"10.1016\/0020-0190(93)90202-K_BIB7","article-title":"On optimal depth threshold circuits for multiplication and related problems","author":"Siu","year":"1992","journal-title":"Manuscript"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390202K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390202K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:27:07Z","timestamp":1555129627000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390202K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["002001909390202K"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90202-k","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}