{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T16:22:30Z","timestamp":1786983750967,"version":"3.56.0"},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"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":8174,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0890-5401(91)90078-g","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"142-154","source":"Crossref","is-referenced-by-count":22,"title":["Boolean circuits versus arithmetic circuits"],"prefix":"10.1016","volume":"91","author":[{"given":"Joachim","family":"von zur Gathen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gadiel","family":"Seroussi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90078-G_BIB1","series-title":"Proceedings, 19th IEEE Symp. Foundations of Computer Science","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978"},{"key":"10.1016\/0890-5401(91)90078-G_BIB2","author":"Aho","year":"1974"},{"key":"10.1016\/0890-5401(91)90078-G_BIB3","doi-asserted-by":"crossref","first-page":"994","DOI":"10.1137\/0215070","article-title":"Log depth circuits for division and related problems","volume":"15","author":"Beame","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90078-G_BIB4","first-page":"47","article-title":"Structured vs. general models in computational complexity, in \u201cLogic and Algorithmic,\u201d Symposium in honour of Ernst Specker","volume":"30","author":"Borodin","year":"1982","journal-title":"Enseign. Math."},{"key":"10.1016\/0890-5401(91)90078-G_BIB5","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0019-9958(82)90766-5","article-title":"Fast parallel matrix and GCD computations","volume":"52","author":"Borodin","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(91)90078-G_BIB6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(91)90078-G_BIB7","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1137\/0218066","article-title":"Very fast parallel polynomial arithmetic","volume":"18","author":"Eberly","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90078-G_BIB8","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/44483.44496","article-title":"The parallel complexity of exponentiating polynomials over finite fields","volume":"35","author":"Fich","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90078-G_BIB9","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1137\/0213050","article-title":"Parallel algorithms for algebraic problems","volume":"13","author":"von zur Gathen","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90078-G_BIB10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0022-0000(85)90043-1","article-title":"Irreducibility of multivariate polynomials","volume":"31","author":"von zur Gathen","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90078-G_BIB11","series-title":"Proceedings, 12th Int. Symp. Math. Foundations of Computer Science","first-page":"93","article-title":"Parallel arithmetic computations: A survey","volume":"Vol. 233","author":"von zur Gathen","year":"1986"},{"key":"10.1016\/0890-5401(91)90078-G_BIB12","doi-asserted-by":"crossref","first-page":"930","DOI":"10.1137\/0216060","article-title":"Computing powers in parallel","volume":"16","author":"von zur Gathen","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90078-G_BIB13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0747-7171(08)80028-4","article-title":"Inversion in finite fields","volume":"9","author":"von zur Gathen","year":"1990","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0890-5401(91)90078-G_BIB14","article-title":"Noncommutative Rings","volume":"Vol. 15","author":"Herstein","year":"1968"},{"key":"10.1016\/0890-5401(91)90078-G_BIB15","series-title":"Proceedings, Fundamentals of Computation Theory 1985","first-page":"167","article-title":"Depth efficient transformations of arithmetic into Boolean circuits","volume":"Vol. 199","author":"Jung","year":"1985"},{"key":"10.1016\/0890-5401(91)90078-G_BIB16","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1109\/TIT.1982.1056592","article-title":"On the power of straight-line computations in finite fields","volume":"28","author":"Lempel","year":"1982","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0890-5401(91)90078-G_BIB17","article-title":"Finite Fields","volume":"Vol. 20","author":"Lidl","year":"1983"},{"key":"10.1016\/0890-5401(91)90078-G_BIB18","series-title":"Proceedings, Aegean Workshop on Computing","first-page":"74","article-title":"O(log(n)) Parallel time finite field inversion","volume":"Vol. 319","author":"Litow","year":"1988"},{"key":"10.1016\/0890-5401(91)90078-G_BIB19","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1137\/0217044","article-title":"Efficient parallel evaluation of straight-line code and arithmetic circuits","volume":"17","author":"Miller","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90078-G_BIB20","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1145\/48014.63138","article-title":"Finite monoids and the fine structure of NC1","volume":"35","author":"Mix Barrington","year":"1988","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90078-G_BIB21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02579205","article-title":"A fast parallel algorithm to compute the rank of a matrix over an arbitrary field","volume":"7","author":"Mulmuley","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0890-5401(91)90078-G_BIB22","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuit complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(91)90078-G_BIB23","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/0020-0190(79)90087-5","article-title":"Factoring numbers in O(log n) arithmetic steps","volume":"8","author":"Shamir","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90078-G_BIB24","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF00289512","article-title":"Berechnung und Programm, I","volume":"1","author":"Strassen","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0890-5401(91)90078-G_BIB25","first-page":"182","article-title":"Vermeidung von Divisionen","volume":"264","author":"Strassen","year":"1973","journal-title":"J. Reine Angew. Math."},{"key":"10.1016\/0890-5401(91)90078-G_BIB26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0212001","article-title":"The computational complexity of continued fractions","volume":"12","author":"Strassen","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90078-G_BIB27","series-title":"Proceedings, 11th Annu. ACM Symp. Theory of Computing","first-page":"249","article-title":"Completeness classes in algebra","author":"Valiant","year":"1979"},{"key":"10.1016\/0890-5401(91)90078-G_BIB28","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(91)90078-G_BIB29","series-title":"\u201cLogic and Algorithmic,\u201d Symposium in honour of Ernst Specker","first-page":"365","article-title":"Reducibility by algebraic projections","volume":"30","author":"Valiant","year":"1982"},{"key":"10.1016\/0890-5401(91)90078-G_BIB30","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1137\/0212043","article-title":"Fast parallel computation of polynomials using few processors","volume":"12","author":"Valiant","year":"1983","journal-title":"SIAM J. Comput."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190078G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190078G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:25:46Z","timestamp":1548879946000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190078G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["089054019190078G"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90078-g","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}