{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T04:35:02Z","timestamp":1648701302666},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":[[1992,7]]},"DOI":"10.1016\/0020-0190(92)90035-t","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"269-272","source":"Crossref","is-referenced-by-count":7,"title":["On iterated integer product"],"prefix":"10.1016","volume":"42","author":[{"given":"Bruce","family":"Litow","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90035-T_BIB1","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\/0020-0190(92)90035-T_BIB2","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1137\/0206054","article-title":"On relating time and space to size and depth","volume":"6","author":"Borodin","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90035-T_BIB3","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with past parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"issue":"4","key":"10.1016\/0020-0190(92)90035-T_BIB4","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1137\/0220048","article-title":"Fast parallel arithmetic via modular representation","volume":"20","author":"Davida","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90035-T_BIB5","author":"Hardy","year":"1979"},{"key":"10.1016\/0020-0190(92)90035-T_BIB6","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1109\/SCT.1989.41816","article-title":"The complexity of iterated multiplication","author":"Immerman","year":"1989","journal-title":"Proc. 4th IEEE Structure in Complexity Theory Conf."},{"key":"10.1016\/0020-0190(92)90035-T_BIB7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1137\/0215017","article-title":"Logarithmic depth circuits for algebraic functions","volume":"15","author":"Reif","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90035-T_BIB8","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-0000(81)90038-6","article-title":"On uniform circuits complexity","volume":"22","author":"Ruzzo","year":"1981","journal-title":"J. Comput. System Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290035T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290035T?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:27:41Z","timestamp":1555144061000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290035T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["002001909290035T"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90035-t","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}