{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T01:11:54Z","timestamp":1782263514349,"version":"3.54.5"},"reference-count":16,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"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":[[1985,6]]},"DOI":"10.1016\/0020-0190(85)90026-2","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"241-248","source":"Crossref","is-referenced-by-count":9,"title":["Independence results about context-free languages and lower bounds"],"prefix":"10.1016","volume":"20","author":[{"given":"Juris","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(85)90026-2_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(85)90026-2_BIB2","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/0204037","article-title":"Relativizations of the P = NP? question","volume":"4","author":"Barker","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(85)90026-2_BIB3","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\/0020-0190(85)90026-2_BIB4","series-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(85)90026-2_BIB5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(79)90046-X","article-title":"Arithmetical hierarchy and complexity of computation","volume":"8","author":"Hajek","year":"1979","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(85)90026-2_BIB6","first-page":"42","article-title":"Context-free languages and Turing machine computations","volume":"Vol. 19","author":"Harmanis","year":"1967"},{"key":"10.1016\/0020-0190(85)90026-2_BIB7","article-title":"Feasible computations and provable complexity properties","volume":"30","author":"Hartmanis","year":"1978"},{"key":"10.1016\/0020-0190(85)90026-2_BIB8","series-title":"Proc. 9th Symp. on Mathematics Foundations of Computer Science","first-page":"70","article-title":"Relative succinctness of representation of language and separation of complexity classes","volume":"74","author":"Hartmanis","year":"1979"},{"issue":"4","key":"10.1016\/0020-0190(85)90026-2_BIB9","doi-asserted-by":"crossref","DOI":"10.1145\/1008335.1008336","article-title":"Independence results in computer science","volume":"8","author":"Hartmanis","year":"1976","journal-title":"ACM SIGACT News"},{"key":"10.1016\/0020-0190(85)90026-2_BIB10","series-title":"Mathematical Foundations of Computer Science","first-page":"364","article-title":"Some connections between representability of complexity classes and the power of formal systems of reasoning","volume":"176","author":"Kowalczyk","year":"1984"},{"key":"10.1016\/0020-0190(85)90026-2_BIB11","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. ACM"},{"key":"10.1016\/0020-0190(85)90026-2_BIB12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(81)90069-4","article-title":"On the structure of sets in NP and other complexity classes","volume":"15","author":"Landweber","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(85)90026-2_BIB13","series-title":"Proc. 21st IEEE Foundations of Computer Science Symp.","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\/0020-0190(85)90026-2_BIB14","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0020-0190(85)90026-2_BIB15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(82)90114-1","article-title":"A uniform approach to obtain diagonal sets in complexity classes","volume":"18","author":"Sch\u00f6ning","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(85)90026-2_BIB16","series-title":"Proc. 15th ACM Symp. on Theory of Computation","first-page":"392","article-title":"Some structural properties of polynomial reducibilities and sets in NP","author":"Young","year":"1983"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900262?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019085900262?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T09:27:08Z","timestamp":1553592428000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019085900262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["0020019085900262"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(85)90026-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}