{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,3]],"date-time":"2026-08-03T21:49:37Z","timestamp":1785793777956,"version":"3.56.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,6,1]],"date-time":"1988-06-01T00:00:00Z","timestamp":581126400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,3,26]],"date-time":"2003-03-26T00:00:00Z","timestamp":1048636800000},"content-version":"vor","delay-in-days":5411,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,6]]},"DOI":"10.1016\/0304-3975(88)90022-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"129-142","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":76,"title":["Complexity classes without machines: On complete languages for UP"],"prefix":"10.1016","volume":"58","author":[{"given":"Juris","family":"Hartmanis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lane A.","family":"Hemachandra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90022-9_BIB1","series-title":"Tech. Rept. TR76-284","article-title":"Some comments on functional self-reducibility and the NP hierarchy","author":"Borodin","year":"1976"},{"key":"10.1016\/0304-3975(88)90022-9_BIB2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0019-9958(82)90439-9","article-title":"On the unique satisfiability problem","volume":"55","author":"Blass","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(88)90022-9_BIB3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","article-title":"Relative to a random oracle A, PA \u2260 NP A with probability 1","volume":"10","author":"Bennet","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(88)90022-9_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\/0304-3975(88)90022-9_BIB5","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/SFCS.1987.30","article-title":"Generic oracles and oracle classes","author":"Blum","year":"1987","journal-title":"Proc. 28th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(88)90022-9_BIB6","series-title":"Proc. 1st Structure in Complexity Theory Conf.","first-page":"105","article-title":"The Boolean hierarchy: hardware over NP","volume":"223","author":"Cai","year":"1986"},{"key":"10.1016\/0304-3975(88)90022-9_BIB7","unstructured":"J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner and G. Wechsung, The Boolean hierarchy I: structural properties, SIAM J. Comput., to appear."},{"key":"10.1016\/0304-3975(88)90022-9_BIB8","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971","journal-title":"Proc. ACM Symp. on Theory of Computation"},{"key":"10.1016\/0304-3975(88)90022-9_BIB9","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."},{"key":"10.1016\/0304-3975(88)90022-9_BIB10","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(88)90022-9_BIB11","first-page":"390","article-title":"Three results on the polynomial isomorphism of complete sets","author":"Goldsmith","year":"1986","journal-title":"Proc. 27th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(88)90022-9_BIB12","first-page":"495","article-title":"Complexity measures for public-key cryptosystems","author":"Grollmann","year":"1984","journal-title":"Proc. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(88)90022-9_BIB13","series-title":"Ph.D. Dissertation","article-title":"Counting in structural complexity theory","author":"Hemachandra","year":"1987"},{"key":"10.1016\/0304-3975(88)90022-9_BIB14","series-title":"Proc. 2nd Structure in Complexity Theory Conference","first-page":"160","article-title":"One-way functions, robustness, and the non-isomorphism of NP-complete sets","author":"Hartmanis","year":"1987"},{"key":"10.1016\/0304-3975(88)90022-9_BIB15","series-title":"Proc. 12th Internat. Conf. Automata Languages and Programming","first-page":"250","article-title":"On complete problems for NP\u2229CoNP","volume":"194","author":"Hartmanis","year":"1985"},{"key":"10.1016\/0304-3975(88)90022-9_BIB16","series-title":"Introduction to Automata theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(88)90022-9_BIB17","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(85)90140-9","article-title":"Some remarks on witness functions for non-polynomial and non-complete sets in NP","volume":"39","author":"Joseph","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(88)90022-9_BIB18","first-page":"380","article-title":"Collapsing degrees","author":"Kurtz","year":"1986","journal-title":"Proc. 27th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(88)90022-9_BIB19","series-title":"Proc. Mathematical Foundations of Computer Science","first-page":"364","article-title":"Some connections between representability of complexity classes and the power of formal reasoning systems","volume":"176","author":"Kowalczyk","year":"1984"},{"key":"10.1016\/0304-3975(88)90022-9_BIB20","series-title":"Tech. Rep. 83-001","article-title":"A relativized failure of the Berman-Hartmanis Conjecture","author":"Kurtz","year":"1983"},{"key":"10.1016\/0304-3975(88)90022-9_BIB21","series-title":"Ph.D. Dissertation","article-title":"Lower bounds in computational complexity","author":"Li","year":"1985"},{"key":"10.1016\/0304-3975(88)90022-9_BIB22","series-title":"Proc. 9th Internat. Conf. on Automata, Languages and Programming","first-page":"523","article-title":"On relativization and the existence of complete sets","volume":"140","author":"Sipser","year":"1982"},{"key":"10.1016\/0304-3975(88)90022-9_BIB23","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"The relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Infor. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900229?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588900229?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:11Z","timestamp":1757477891000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588900229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,6]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1988,6]]}},"alternative-id":["0304397588900229"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90022-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Complexity classes without machines: On complete languages for UP","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(88)90022-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}