{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T03:17:40Z","timestamp":1778296660031,"version":"3.51.4"},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,12,1]],"date-time":"1978-12-01T00:00:00Z","timestamp":281318400000},"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":12647,"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":[[1978,12]]},"DOI":"10.1016\/0304-3975(78)90018-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"273-286","source":"Crossref","is-referenced-by-count":42,"title":["On log-tape isomorphisms of complete sets"],"prefix":"10.1016","volume":"7","author":[{"given":"J.","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(78)90018-X_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(78)90018-X_BIB2","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphisms and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(78)90018-X_BIB3","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971","journal-title":"Proc. 3rd Annu. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(78)90018-X_BIB4","series-title":"Advances in Computers","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0065-2458(08)60449-0","article-title":"On the structure of feasible computations","author":"Hartmanis","year":"1976"},{"key":"10.1016\/0304-3975(78)90018-X_BIB5","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/S0022-0000(75)80050-X","article-title":"Space-bounded reducibility among combinatorial problems","volume":"11","author":"Jones","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(78)90018-X_BIB6","doi-asserted-by":"crossref","unstructured":"N.D. Jones and W.T. Laaser, Problems complete for deterministic polynomial time, Theoret. Comput. Sci. (to appear)","DOI":"10.1145\/800119.803883"},{"key":"10.1016\/0304-3975(78)90018-X_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01683259","article-title":"New problems complete for log space","volume":"10","author":"Jones","year":"1976","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(78)90018-X_BIB8","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(78)90018-X_BIB9","first-page":"1","article-title":"Word problems requiring exponential time: Preliminary report","author":"Stockmeyer","year":"1973","journal-title":"Proc. 5th Annu. ACM Symp. on Theory of Computing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439757890018X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439757890018X?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:23:03Z","timestamp":1555125783000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439757890018X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,12]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,12]]}},"alternative-id":["030439757890018X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(78)90018-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1978,12]]}}}