{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T21:00:13Z","timestamp":1648587613399},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,7,1]],"date-time":"2003-07-01T00:00:00Z","timestamp":1057017600000},"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":[[2003,7]]},"DOI":"10.1016\/s0020-0190(03)00253-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"39-44","source":"Crossref","is-referenced-by-count":0,"title":["Tighter constant-factor time hierarchies"],"prefix":"10.1016","volume":"87","author":[{"given":"Amir M.","family":"Ben-Amram","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(03)00253-9_BIB001","series-title":"Algorithms and Theory of Computation Handbook","article-title":"Complexity classes","author":"Allender","year":"1998"},{"issue":"2","key":"10.1016\/S0020-0190(03)00253-9_BIB002","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s002360000038","article-title":"Computational complexity via programming languages: Constant factors do matter","volume":"37","author":"Ben-Amram","year":"2000","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(03)00253-9_BIB003","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1999-381201","article-title":"A precise version of a time hierarchy theorem","volume":"38","author":"Ben-Amram","year":"1999","journal-title":"Fund. Inform."},{"key":"10.1016\/S0020-0190(03)00253-9_BIB004","series-title":"STOC'93. Symposium on Theory of Computing","first-page":"602","article-title":"Constant time factors do matter","author":"Jones","year":"1993"},{"key":"10.1016\/S0020-0190(03)00253-9_BIB005","series-title":"Programming Languages and Systems\u2014ESOP'96, Link\u00f6ping, Sweden","first-page":"311","article-title":"Linear time hierarchies for a functional language machine model","volume":"1058","author":"Rose","year":"1996"},{"key":"10.1016\/S0020-0190(03)00253-9_BIB006","series-title":"Proc. 6th Annual IEEE Symp. on Switching Circuit Theory and Logical Design","first-page":"173","article-title":"Translational methods and computational complexity","author":"Ruby","year":"1965"},{"issue":"2","key":"10.1016\/S0020-0190(03)00253-9_BIB007","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1137\/0205018","article-title":"On families of languages defined by time-bounded random access machines","volume":"5","author":"Sudborough","year":"1976","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002539?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019003002539?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T19:07:04Z","timestamp":1584644824000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019003002539"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,7]]}},"alternative-id":["S0020019003002539"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00253-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,7]]}}}