{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:45:49Z","timestamp":1759063549191},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":8113,"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":[[1991,5]]},"DOI":"10.1016\/0304-3975(91)90173-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"85-93","source":"Crossref","is-referenced-by-count":3,"title":["Size-depth trade-offs for monotone arithmetic circuits"],"prefix":"10.1016","volume":"82","author":[{"given":"Marc","family":"Snir","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90173-Y_BIB1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90173-Y_BIB2","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1109\/T-C.1975.224291","article-title":"Time and parallel processor bounds for linear recurrence systems","volume":"24","author":"Chen","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(91)90173-Y_BIB3","first-page":"1","article-title":"Matrix multiplication via arithmetic progression","author":"Coppersmith","year":"1987","journal-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90173-Y_BIB4","first-page":"75","article-title":"Complexity measures for regular expressions","author":"Ehrenfeucht","year":"1974","journal-title":"Proc. 6th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90173-Y_BIB5","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1145\/322017.322030","article-title":"The complexity of evaluation of linear recurrences","volume":"24","author":"Hyafil","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90173-Y_BIB6","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1145\/322326.322341","article-title":"Some exact complexity results for straight-line computations over semirings","volume":"29","author":"Jerrum","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90173-Y_BIB7","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\/0304-3975(91)90173-Y_BIB8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1147\/rd.312.0235","article-title":"The complexity of computations by networks","volume":"31","author":"Pippenger","year":"1987","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/0304-3975(91)90173-Y_BIB9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0196-6774(86)90003-9","article-title":"Depth-size trade-offs for parallel prefix computation","volume":"7","author":"Snir","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(91)90173-Y_BIB10","article-title":"Lower bounds on the number of multiplications and the number of additions in monotone computations","author":"Shamir","year":"1977","journal-title":"IBM Tech. Rep. RC 6757"},{"key":"10.1016\/0304-3975(91)90173-Y_BIB11","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":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190173Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190173Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:53:36Z","timestamp":1555127616000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190173Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["030439759190173Y"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90173-y","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}