{"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":1778296660011,"version":"3.51.4"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":10790,"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":[[1984]]},"DOI":"10.1016\/0304-3975(84)90111-7","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:44:32Z","timestamp":1034286272000},"page":"17-32","source":"Crossref","is-referenced-by-count":79,"title":["Computation times of NP sets of different densities"],"prefix":"10.1016","volume":"34","author":[{"given":"J.","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Y.","family":"Yesha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(84)90111-7_BIB1","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978","journal-title":"Proc. 19th IEEE Foundations of Computer Science Symp."},{"key":"10.1016\/0304-3975(84)90111-7_BIB2","first-page":"63","article-title":"Relationship between density and deterministic complexity of NP-complete languages","volume":"62","author":"Berman","year":"1978"},{"key":"10.1016\/0304-3975(84)90111-7_BIB3","first-page":"96","article-title":"Relative to a random oracle PA \u2260 NPA \u2260 CoNPA with probability I","volume":"10","author":"Bennet","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(84)90111-7_BIB4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","article-title":"On isomorphism and density of NP and other complete sets","volume":"6","author":"Berman","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(84)90111-7_BIB5","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/S0019-9958(74)90473-2","article-title":"Tally languages and complexity classes","volume":"26","author":"Book","year":"1974","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(84)90111-7_BIB6","first-page":"254","article-title":"Relativizing time and space","author":"Book","year":"1981","journal-title":"Proc. 21st IEEE Foundations of Computer Science Symp."},{"key":"10.1016\/0304-3975(84)90111-7_BIB7","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0304-3975(84)90111-7_BIB8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(83)90024-8","article-title":"On sparse sets in NP-P","volume":"16","author":"Hartmanis","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(84)90111-7_BIB9","first-page":"382","article-title":"Sparse sets in NP-P:EXPTIME vs. NEXPTIME","author":"Hartmanis","year":"1983","journal-title":"Proc. 15th ACM Symp. Theor. Comput."},{"key":"10.1016\/0304-3975(84)90111-7_BIB10","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980","journal-title":"Proc. 12th ACM Symp. Theor. Comput."},{"key":"10.1016\/0304-3975(84)90111-7_BIB11","first-page":"42","article-title":"Sparse complete sets for NP: Solution of a conjecture of Berman and Harmanis","author":"Mahaney","year":"1980","journal-title":"Proc. 21st IEEE Foundations of Computer Science Symp."},{"key":"10.1016\/0304-3975(84)90111-7_BIB12","unstructured":"V. Sewelson, Private communication."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901117?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397584901117?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:59:20Z","timestamp":1555192760000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397584901117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1984]]}},"alternative-id":["0304397584901117"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(84)90111-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1984]]}}}