{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:53Z","timestamp":1759638413209},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":8963,"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":[[1989,1]]},"DOI":"10.1016\/0304-3975(89)90066-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"43-61","source":"Crossref","is-referenced-by-count":7,"title":["On the relative complexity of hard problems for complexity classes without complete problems"],"prefix":"10.1016","volume":"63","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90066-2_BIB1","first-page":"75","article-title":"Two theorems on random polynomial time","author":"Adleman","year":"1978","journal-title":"Proc. 19th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(89)90066-2_BIB2","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0019-9958(85)80020-6","article-title":"Sublattices of the polynomial time degrees","volume":"65","author":"Ambos-Spies","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(89)90066-2_BIB3","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0020-0190(86)90078-5","article-title":"A note on complete problems for complexity classes","volume":"23","author":"Ambos-Spies","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(89)90066-2_BIB4","series-title":"Trends in Theoretical Computer Science","first-page":"95","article-title":"Polynomial time degrees of NP-sets","author":"Ambos-Spies","year":"1987"},{"key":"10.1016\/0304-3975(89)90066-2_BIB5","series-title":"Computation Theory and Logic","first-page":"1","article-title":"Minimal pairs for polynomial time reducibilities","volume":"270","author":"Ambos-Spies","year":"1987"},{"key":"10.1016\/0304-3975(89)90066-2_BIB6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0022-0000(81)90021-0","article-title":"A note on structure and looking back applied to the relative complexity of computable functions","volume":"22","author":"Chew","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(89)90066-2_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."},{"key":"10.1016\/0304-3975(89)90066-2_BIB8","first-page":"495","article-title":"Complexity measures for public-key crypto-systems","author":"Grollmann","year":"1984","journal-title":"Proc. 25th IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(89)90066-2_BIB9","series-title":"Trends in Theoretical Computer Science","first-page":"1","article-title":"Logic and the challenge of computer science","author":"Gurevich","year":"1987"},{"key":"10.1016\/0304-3975(89)90066-2_BIB10","first-page":"382","article-title":"Sparse sets in NP-P: Exptime versus Nexptime","author":"Hartmanis","year":"1983","journal-title":"Proc. 15th ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(89)90066-2_BIB11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(84)90111-7","article-title":"Computation times of NP sets of different densities","volume":"34","author":"Hartmanis","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90066-2_BIB12","series-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0304-3975(89)90066-2_BIB13","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(89)90066-2_BIB14","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\/0304-3975(89)90066-2_BIB15","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\/0304-3975(89)90066-2_BIB16","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0022-0000(82)90002-2","article-title":"Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis","volume":"25","author":"Mahaney","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(89)90066-2_BIB17","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\/0304-3975(89)90066-2_BIB18","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01744288","article-title":"P-selective sets, tally languages, and the behaviour of polynomial time reducibilities on NP","volume":"13","author":"Selman","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(89)90066-2_BIB19","series-title":"Proc. Internat. Coll. Automata, Languages and Programming","first-page":"523","article-title":"On relativizations and the existence of complete sets","volume":"140","author":"Sipser","year":"1982"},{"key":"10.1016\/0304-3975(89)90066-2_BIB20","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":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90066-2_BIB21","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(76)90097-1","article-title":"Relative complexity of checking and evaluating","volume":"5","author":"Valiant","year":"1976","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(89)90066-2_BIB22","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial hierarchy","volume":"3","author":"Wrathall","year":"1977","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900662?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900662?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:55:08Z","timestamp":1555113308000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900662"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0304397589900662"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90066-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}