{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:26Z","timestamp":1759639046377,"version":"3.44.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1999,12,22]],"date-time":"1999-12-22T00:00:00Z","timestamp":945820800000},"content-version":"vor","delay-in-days":1635,"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":[[1995,7]]},"DOI":"10.1016\/0304-3975(94)00290-y","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T06:09:04Z","timestamp":1051250944000},"page":"371-380","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["P-selectivity: Intersections and indices"],"prefix":"10.1016","volume":"145","author":[{"given":"Lane A.","family":"Hemaspaandra","sequence":"first","affiliation":[]},{"given":"Jiang","family":"Zhigen","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00290-Y_BIB1","series-title":"Proc. 9th Structure in Complexity Theory Conf.","first-page":"12","article-title":"Approximable sets","author":"Beigel","year":"1994"},{"issue":"4","key":"10.1016\/0304-3975(94)00290-Y_BIB2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(93)90146-Z","article-title":"Twenty questions to a P-selector","volume":"48","author":"Buhrman","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)00290-Y_BIB3","series-title":"Proc. 8th Structure in Complexity Theory Conf.","first-page":"44","article-title":"P-selective self-reducible sets: A new characterization of P","author":"Buhrman","year":"1993"},{"issue":"3","key":"10.1016\/0304-3975(94)00290-Y_BIB4","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/193820.193828","article-title":"Semi-membership algorithms: Some recent advances","volume":"25","author":"Denny-Brown","year":"1994","journal-title":"SIGACT News"},{"key":"10.1016\/0304-3975(94)00290-Y_BIB5","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0304-3975(88)90022-9","article-title":"Complexity classes without machines: On complete languages for UP","volume":"58","author":"Hartmanis","year":"1988","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/0304-3975(94)00290-Y_BIB6","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/S0022-0000(71)80007-7","article-title":"The use of lists in the study of undecidable problems in automata theory","volume":"5","author":"Hartmanis","year":"1971","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)00290-Y_BIB7","unstructured":"L. Hemaspaandra and S. Jha, Defying upward and downward separation, Inform. and Comput., to appear."},{"issue":"2","key":"10.1016\/0304-3975(94)00290-Y_BIB8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0304-3975(92)90318-A","article-title":"Separating complexity classes with tally oracles","volume":"92","author":"Hemachandra","year":"1992","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0304-3975(94)00290-Y_BIB9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1142\/S012905419300016X","article-title":"Banishing robust Turing completeness","volume":"4","author":"Hemaspaandra","year":"1993","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00290-Y_BIB10","unstructured":"L. Hemaspaandra, A. Naik, M. Ogihara and A. Selman, Computing solutions uniquely collapses the polynomial hierarchy, SIAM J. Comput., to appear."},{"issue":"2","key":"10.1016\/0304-3975(94)00290-Y_BIB11","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1090\/S0002-9947-1968-0220595-7","article-title":"Semirecursive sets and positive reducibility","volume":"131","author":"Jockusch","year":"1968","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(94)00290-Y_BIB12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(83)90013-2","article-title":"On self-reducibility and weak P-selectivity","volume":"26","author":"Ko","year":"1983","journal-title":"J. Comput. System Sci."},{"issue":"1","key":"10.1016\/0304-3975(94)00290-Y_BIB13","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0214003","article-title":"On circuit-size complexity and the low hierarchy in NP","volume":"14","author":"Ko","year":"1985","journal-title":"SIAM J. Comput."},{"year":"1983","author":"Kurtz","key":"10.1016\/0304-3975(94)00290-Y_BIB14"},{"key":"10.1016\/0304-3975(94)00290-Y_BIB15","series-title":"Proc. 9th Structure in Complexity Theory Conf.","first-page":"2","article-title":"Polynomial-time membership comparable sets","author":"Ogihara","year":"1994"},{"year":"1967","series-title":"The Theory of Recursive Functions and Effective Computability","author":"Rogers","key":"10.1016\/0304-3975(94)00290-Y_BIB16"},{"key":"10.1016\/0304-3975(94)00290-Y_BIB17","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01744288","article-title":"P-selective sets, tally languages, and the behavior of polynomial time reducibilities on NP","volume":"13","author":"Selman","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(94)00290-Y_BIB18","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/S0019-9958(82)80084-3","article-title":"Analogues of semirecursive sets and effective reducibilities to the study of NP complexity","volume":"52","author":"Selman","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(94)00290-Y_BIB19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(82)90039-1","article-title":"Reductions on NP and P-selective sets","volume":"19","author":"Selman","year":"1982","journal-title":"Theoret. Computer. Sci."},{"key":"10.1016\/0304-3975(94)00290-Y_BIB20","series-title":"Perspectives in Mathematical Logic","article-title":"Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets","author":"Soare","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400290Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759400290Y?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:17:46Z","timestamp":1757477866000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759400290Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["030439759400290Y"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00290-y","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1995,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"P-selectivity: Intersections and indices","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(94)00290-Y","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}