{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:59Z","timestamp":1761611159132},"reference-count":27,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1985,5,1]],"date-time":"1985-05-01T00:00:00Z","timestamp":483753600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":10305,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1985,5]]},"DOI":"10.1016\/s0019-9958(85)80004-8","type":"journal-article","created":{"date-parts":[[2005,5,3]],"date-time":"2005-05-03T07:12:14Z","timestamp":1115104334000},"page":"158-181","source":"Crossref","is-referenced-by-count":74,"title":["Sparse sets in NP-P: EXPTIME versus NEXPTIME"],"prefix":"10.1016","volume":"65","author":[{"given":"J.","family":"Hartmanis","sequence":"first","affiliation":[]},{"given":"N.","family":"Immerman","sequence":"additional","affiliation":[]},{"given":"V.","family":"Sewelson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(85)80004-8_bib1","series-title":"The design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0019-9958(85)80004-8_bib2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the PN = ?NP question","volume":"4","author":"Baker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(85)80004-8_bib3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01768464","article-title":"Inclusion Complete Tally Languages and the Hartmanis-Berman Conjecture","volume":"11","author":"Book","year":"1978","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0019-9958(85)80004-8_bib4","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\/S0019-9958(85)80004-8_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":"Infor. and Control"},{"key":"10.1016\/S0019-9958(85)80004-8_bib6","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0304-3975(79)90043-4","article-title":"A second step towards the polynomial hierarchy","volume":"8","author":"Baker","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(85)80004-8_bib7","series-title":"IEEE Found. Comput. Sci. Symposium","first-page":"254","article-title":"Relativizing time and space","author":"Book","year":"1981"},{"key":"10.1016\/S0019-9958(85)80004-8_bib8","series-title":"Proceedings of the 3rd Annual ACM Symposium on the Theory of Computation","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/S0019-9958(85)80004-8_bib9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0022-0000(73)80028-5","article-title":"A hierarchy of nondeterministic time complexity","volume":"7","author":"Cook","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(85)80004-8_bib10","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0019-9958(85)80004-8_bib11","first-page":"55","article-title":"On sparse sets in NP-P","volume":"16","author":"Hartmanis","year":"1983"},{"key":"10.1016\/S0019-9958(85)80004-8_bib12","series-title":"Proceedings 15th ACM Symposium on the Theory of Computation","first-page":"382","article-title":"Sparse sets in NP-P: EXPTIME versus NEXPTIME","author":"Hartmanis","year":"1983"},{"key":"10.1016\/S0019-9958(85)80004-8_bib13","doi-asserted-by":"crossref","unstructured":"Heller, H., On relativized exponential and probabilistic complexity classes, Inform. and Control, to appear.","DOI":"10.1016\/S0019-9958(86)80012-2"},{"key":"10.1016\/S0019-9958(85)80004-8_bib14","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1145\/321724.321727","article-title":"A note concerning nondeterministic tape complexities","volume":"19","author":"Ibarra","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(85)80004-8_bib15","series-title":"Oracles for which NP has polynomial size circuits, draft","author":"Immerman","year":"1982"},{"key":"10.1016\/S0019-9958(85)80004-8_bib16","unstructured":"Joseph, D. (1982), Private communication."},{"key":"10.1016\/S0019-9958(85)80004-8_bib17","series-title":"Proceedings 12th Annual ACM Symposium on Theory of Computation","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/S0019-9958(85)80004-8_bib18","article-title":"On Relative Diagonals","author":"Kozen","year":"1980","journal-title":"IBM Research Report RC 8184"},{"key":"10.1016\/S0019-9958(85)80004-8_bib19","series-title":"Proceedings 10th Annual ACM Symposium on Theory of Computing","first-page":"287","article-title":"Indexings of subrecursive classes","author":"Kozen","year":"1978"},{"key":"10.1016\/S0019-9958(85)80004-8_bib20","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1137\/0214008","article-title":"Sparse sets in NP-P: Relativizations","volume":"14","author":"Kurtz","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0019-9958(85)80004-8_bib21","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0019-9958(85)80004-8_bib22_1","series-title":"Proceedings 21st IEEE Foundations of Computer Science Symposium","first-page":"42","article-title":"Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis","author":"Mahaney","year":"1980"},{"key":"10.1016\/S0019-9958(85)80004-8_bib22_2","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","volume":"25","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(85)80004-8_bib23","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0022-0000(77)80041-X","article-title":"Techniques for separating space complexity classes","volume":"14","author":"Seiferas","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0019-9958(85)80004-8_bib24","series-title":"Ph. D. thesis","article-title":"A Study of the Structure of NP","author":"Sewelson","year":"1983"},{"key":"10.1016\/S0019-9958(85)80004-8_bib25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","article-title":"The polynomial time hierarchy","volume":"3","author":"Stockmeyer","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0019-9958(85)80004-8_bib26","article-title":"Relativization, Reducibilities, and the Exponential Hierarchy","author":"Wilson","year":"1980"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800048?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995885800048?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T09:43:42Z","timestamp":1550396622000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995885800048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,5]]},"references-count":27,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1985,5]]}},"alternative-id":["S0019995885800048"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(85)80004-8","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1985,5]]}}}