{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T08:20:31Z","timestamp":1775809231698,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,3,1]],"date-time":"1986-03-01T00:00:00Z","timestamp":510019200000},"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":[[1986,3]]},"DOI":"10.1016\/0020-0190(86)90054-2","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"113-117","source":"Crossref","is-referenced-by-count":14,"title":["Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets"],"prefix":"10.1016","volume":"22","author":[{"given":"Klaus","family":"Ambos-Spies","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90054-2_BIB1","series-title":"STACS 84, Symposium on Theoretical Aspects of Computer Science","first-page":"198","article-title":"On the structure of polynomial time degrees","volume":"166","author":"Ambos-Spies","year":"1984"},{"key":"10.1016\/0020-0190(86)90054-2_BIB2","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies, Sublattices of the polynomial time degrees, Inform. and Control, to appear.","DOI":"10.1016\/S0019-9958(85)80020-6"},{"key":"10.1016\/0020-0190(86)90054-2_BIB3","doi-asserted-by":"crossref","unstructured":"K. Ambos-Spies, An inhomogeneity in the structure of Karp degrees, SIAM J. Comput., to appear.","DOI":"10.1137\/0215067"},{"key":"10.1016\/0020-0190(86)90054-2_BIB4","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\/0020-0190(86)90054-2_BIB5","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(86)90054-2_BIB6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison of polynomial time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(86)90054-2_BIB7","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."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900542?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900542?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:29:09Z","timestamp":1553592549000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900542"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["0020019086900542"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90054-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}