{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:58:33Z","timestamp":1775282313970,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,4,1]],"date-time":"1993-04-01T00:00:00Z","timestamp":733622400000},"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,4]]},"DOI":"10.1016\/0020-0190(93)90041-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"303-307","source":"Crossref","is-referenced-by-count":50,"title":["n\u03c9(log n) lower bounds on the size of depth-3 threshold cicuits with AND gates at the bottom"],"prefix":"10.1016","volume":"45","author":[{"given":"Alexander","family":"Razborov","sequence":"first","affiliation":[]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(93)90041-7_BIB1","first-page":"63","article-title":"On a method for obtaining more than quadratic effective lower bounds for the complexity of \u03c0-schemes","volume":"42","author":"Andreev","year":"1987","journal-title":"Moscow Univ. Math. Bull."},{"key":"10.1016\/0020-0190(93)90041-7_BIB2","first-page":"1","article-title":"Multiparty protocols and logspace-hard pseudorandom sequences","author":"Babai","year":"1989","journal-title":"Proc. 21st ACM Symp. on Theory of Computing"},{"key":"10.1016\/0020-0190(93)90041-7_BIB3","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":"Math. Systems Theory"},{"key":"10.1016\/0020-0190(93)90041-7_BIB4","first-page":"2","article-title":"Majority gates vs. general weighted threshold gates","author":"Goldmann","year":"1992","journal-title":"Proc. 7th Structure in Complexity Theory Ann. Conf."},{"key":"10.1016\/0020-0190(93)90041-7_BIB5","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 IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90041-7_BIB6","article-title":"Computational limitations on small depth circuits","author":"H\u00e5stad","year":"1986"},{"issue":"2","key":"10.1016\/0020-0190(93)90041-7_BIB7","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01272517","article-title":"On the power of small-depth threshold circuits","volume":"1","author":"H\u00e5stad","year":"1991","journal-title":"Comput. Complexity"},{"key":"10.1016\/0020-0190(93)90041-7_BIB8","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1109\/SCT.1991.160273","article-title":"Super-logarithmic depth lower bounds via direct sum in communication complexity","author":"Karchmer","year":"1991","journal-title":"Proc. 6th Structure in Complexity Theory Conf."},{"key":"10.1016\/0020-0190(93)90041-7_BIB9","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1109\/SCT.1991.160275","article-title":"Geometric arguments yield better bounds for threshold circuits and distributed computing","author":"Krause","year":"1991","journal-title":"Proc. 6th Structure in Complexity Theory Conf."},{"key":"10.1016\/0020-0190(93)90041-7_BIB10","first-page":"777","article-title":"Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in","author":"Krause","year":"1991","journal-title":"Proc. 32th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90041-7_BIB11","first-page":"42","article-title":"On small depth threshold circuits","volume":"621","author":"Razborov","year":"1992"},{"key":"10.1016\/0020-0190(93)90041-7_BIB12","first-page":"1","article-title":"Separating the polynomial-time hierarchy by oracles","author":"Yao","year":"1985","journal-title":"Proc. 26th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(93)90041-7_BIB13","first-page":"619","article-title":"On ACC and threshold circuits","author":"Yao","year":"1990","journal-title":"Proc. 31th IEEE Symp. on Foundations of Computer Science"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093900417?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093900417?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T05:39:27Z","timestamp":1580881167000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019093900417"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,4]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,4]]}},"alternative-id":["0020019093900417"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90041-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,4]]}}}