{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T08:53:00Z","timestamp":1673167980670},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"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":[[1991,8]]},"DOI":"10.1016\/0020-0190(91)90110-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"143-146","source":"Crossref","is-referenced-by-count":11,"title":["Linear-size constant-depth polylog-threshold circuits"],"prefix":"10.1016","volume":"39","author":[{"given":"Prabhakar","family":"Ragde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avi","family":"Wigderson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90110-4_BIB1","first-page":"471","article-title":"A theorem on Probabilistic constant depth computation","author":"Ajtai","year":"1984","journal-title":"Proc. 16th ACM STOC"},{"key":"10.1016\/0020-0190(91)90110-4_BIB2","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0022-0000(85)90015-7","article-title":"Unbounded fan-in circuits and associative functions","volume":"30","author":"Chandra","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(91)90110-4_BIB3","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. Comput."},{"key":"10.1016\/0020-0190(91)90110-4_BIB4","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/S0019-9958(86)80006-7","article-title":"Definability by constant-depth polynomial-size circuits","volume":"70","author":"Denenberg","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(91)90110-4_BIB5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(85)90045-3","article-title":"Bounded-depth, polynomial-size circuits for symmetric functions","volume":"36","author":"Fagin","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(91)90110-4_BIB6","first-page":"179","article-title":"Relations among concurrent-write PRAMs","author":"Fich","year":"1984","journal-title":"Proc. 3rd ACM PODC"},{"key":"10.1016\/0020-0190(91)90110-4_BIB7","first-page":"6","article-title":"Almost optimal lower bounds for small depth circuits","author":"H\u00e5stad","year":"1986","journal-title":"Proc. 18th ACM STOC"},{"key":"10.1016\/0020-0190(91)90110-4_BIB8","first-page":"170","article-title":"On the program size of perfect and universal hash functions","author":"Mehlhorn","year":"1982","journal-title":"Proc. 23rd IEEE FOCS"},{"key":"10.1016\/0020-0190(91)90110-4_BIB9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/321879.321882","article-title":"Bounds to complexities of networks for sorting and for switching","volume":"22","author":"Muller","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(91)90110-4_BIB10","article-title":"The parallel simplicity of compaction and chaining","author":"Ragde","year":"1990","journal-title":"Proc. 17th ICALP"},{"key":"10.1016\/0020-0190(91)90110-4_BIB11","series-title":"Forschungsbericht Nr. 326","first-page":"523","article-title":"Symmetric functions in ACo can be computed in constant depth with every small size","author":"Wegener","year":"1989"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091901104?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019091901104?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:24:54Z","timestamp":1555143894000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019091901104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["0020019091901104"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90110-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}