{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T07:52:59Z","timestamp":1775461979429,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1985]]},"DOI":"10.1016\/0304-3975(85)90045-3","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"239-250","source":"Crossref","is-referenced-by-count":44,"special_numbering":"C","title":["Bounded-depth, polynomial-size circuits for symmetric functions"],"prefix":"10.1016","volume":"36","author":[{"given":"Ronald","family":"Fagin","sequence":"first","affiliation":[]},{"given":"Maria M.","family":"Klawe","sequence":"additional","affiliation":[]},{"given":"Nicholas J.","family":"Pippenger","sequence":"additional","affiliation":[]},{"given":"Larry","family":"Stockmeyer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90045-3_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","article-title":"\u03a311-formulae on finite structures","volume":"24","author":"Ajtai","year":"1983","journal-title":"Annals Pure and Applied Logic"},{"key":"10.1016\/0304-3975(85)90045-3_BIB2","series-title":"Proc. 16th ACM SIGACT Symp. on the Theory of Computing","first-page":"471","article-title":"A theorem on probabilistic constant depth computations","author":"Ajtai","year":"1984"},{"key":"10.1016\/0304-3975(85)90045-3_BIB3","series-title":"Proc. 16th ACM SIGACT Symp. on the Theory of Computing","first-page":"475","article-title":"Threshold functions and bounded depth monotone circuits","author":"Boppana","year":"1984"},{"key":"10.1016\/0304-3975(85)90045-3_BIB4","series-title":"Proc. 15th ACM Symp. on Theory of Computing","first-page":"52","article-title":"Unbounded fan-in circuits and associative functions","author":"Chandra","year":"1983"},{"key":"10.1016\/0304-3975(85)90045-3_BIB5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0304-3975(85)90045-3_BIB6","series-title":"Report TR-26-83","article-title":"Cardinalities definable by constant-depth, polynomial-size circuits","author":"Denenberg","year":"1983"},{"key":"10.1016\/0304-3975(85)90045-3_BIB7","series-title":"Proc. 22nd IEEE Symp. on Foundations of Computer Science","first-page":"260","article-title":"Parity, circuits, and the polynomial time hierarchy","author":"Furst","year":"1981"},{"key":"10.1016\/0304-3975(85)90045-3_BIB8","first-page":"1149","article-title":"Complexity bounds for the realization of monotonic symmetrical functions by means of formulas in the basis \u2228, &, \u00ac","volume":"14","author":"Khasin","year":"1970","journal-title":"Sov. Phys. Dokl."},{"key":"10.1016\/0304-3975(85)90045-3_BIB9","unstructured":"E. Mayr, Personal communication, 1984."},{"key":"10.1016\/0304-3975(85)90045-3_BIB10","series-title":"Error Correcting Codes","author":"Peterson","year":"1961"},{"key":"10.1016\/0304-3975(85)90045-3_BIB11","series-title":"Proc. 15th ACM Symp. on Theory of Computing","first-page":"61","article-title":"Borel sets and circuit complexity","author":"Sipser","year":"1983"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900453?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900453?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T16:52:58Z","timestamp":1553187178000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585900453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":11,"alternative-id":["0304397585900453"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90045-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}