{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,22]],"date-time":"2026-02-22T16:54:24Z","timestamp":1771779264595,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2005,8,19]],"date-time":"2005-08-19T00:00:00Z","timestamp":1124409600000},"content-version":"vor","delay-in-days":4158,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,4]]},"DOI":"10.1016\/s0022-0000(05)80006-6","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"324-336","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["On reductions of NP sets to sparse sets"],"prefix":"10.1016","volume":"48","author":[{"given":"Steven","family":"Homer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luc","family":"Longpr\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80006-6_bib1","series-title":"Complexity Theory: Current Research","first-page":"1","article-title":"Reductions to Sets of Low Information Content","author":"Arvind","year":"1993"},{"key":"10.1016\/S0022-0000(05)80006-6_bib2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/0217018","article-title":"Complexity measures for public-key cryptosystems","volume":"11","author":"Grollmann","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80006-6_bib3","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0022-0000(89)90024-X","article-title":"PNP[log n] and sparse Turing-complete sets for NP","volume":"39","author":"Kadin","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(05)80006-6_bib4","series-title":"Proceedings 12th ACM Symp. on Theory of Computing","first-page":"302","article-title":"Some connections between nonuniform and uniform complexity classes","author":"Karp","year":"1980"},{"key":"10.1016\/S0022-0000(05)80006-6_bib5","first-page":"191","article-title":"Turing machines that take advice","volume":"28","author":"Karp","year":"1982","journal-title":"Enseign. Math."},{"key":"10.1016\/S0022-0000(05)80006-6_bib6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(82)90085-8","article-title":"Strong nondeterministic polynomial-time reducibilities","volume":"21","author":"Long","year":"1982","journal-title":"Theoret. Comput. Sci."},{"issue":"No. 3","key":"10.1016\/S0022-0000(05)80006-6_bib7","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1137\/0214043","article-title":"On restricting the size of oracles compared with restricting access to oracles","volume":"14","author":"Long","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(05)80006-6_bib8","article-title":"Resource Bounded Kolmogorov Complexity, a Link between Computational Complexity and Information Theory","author":"Longpr\u00e9","year":"1986"},{"key":"10.1016\/S0022-0000(05)80006-6_bib9","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1993"},{"key":"10.1016\/S0022-0000(05)80006-6_bib10","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\/S0022-0000(05)80006-6_bib11","series-title":"Proceedings, Structure in Complexity Theory Sixth Annual Conference","first-page":"139","article-title":"On one query self-reducible sets","author":"Ogiwara","year":"1991"},{"key":"10.1016\/S0022-0000(05)80006-6_bib12","series-title":"Proceedings 22nd Annual ACM Symposium on Theory of Computing","first-page":"457","article-title":"On polynomial time bounded truth-table reducibility of NP sets to sparse sets","author":"Ogiwara","year":"1990"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800066?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000005800066?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T11:36:54Z","timestamp":1666525014000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000005800066"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["S0022000005800066"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80006-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On reductions of NP sets to sparse sets","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0022-0000(05)80006-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1994 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}