{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:39:21Z","timestamp":1649129961899},"reference-count":23,"publisher":"Elsevier BV","issue":"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\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,7]]},"DOI":"10.1016\/0020-0190(95)00073-l","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:04:31Z","timestamp":1027649071000},"page":"81-87","source":"Crossref","is-referenced-by-count":1,"title":["Some results on selectivity and self-reducibility"],"prefix":"10.1016","volume":"55","author":[{"given":"Jie","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00073-L_BIB1","series-title":"Proc. 9th Structure in Complexity Theory Conf.","first-page":"24","article-title":"Polynomial-time truth-table reductions to p-selective sets","author":"Agrawal","year":"1994"},{"key":"10.1016\/0020-0190(95)00073-L_BIB2","series-title":"Structural Complexity Theory I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0020-0190(95)00073-L_BIB3","series-title":"Proc. 9th Structure in Complexity Theory Conf.","first-page":"12","article-title":"Approximable sets","author":"Beigel","year":"1994"},{"key":"10.1016\/0020-0190(95)00073-L_BIB4","series-title":"Proc. STOC","first-page":"1","article-title":"PP is closed under intersection","author":"Beigel","year":"1991"},{"key":"10.1016\/0020-0190(95)00073-L_BIB5","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"},{"key":"10.1016\/0020-0190(95)00073-L_BIB6","unstructured":"J. Cai, A. Naik and A. Selman, On p-selective sets and adaptive versus nonadaptive queries to NP, Manuscript."},{"key":"10.1016\/0020-0190(95)00073-L_BIB7","series-title":"Proc. 6th Structure in Complexity Theory Conf.","first-page":"13","article-title":"PP is closed under truth-table reductions","author":"Fortnow","year":"1991"},{"key":"10.1016\/0020-0190(95)00073-L_BIB8","article-title":"Selectivity: Reductions, nondeterminism and function classes","author":"Hemaspaandra","year":"1993"},{"key":"10.1016\/0020-0190(95)00073-L_BIB9","series-title":"Proc. 5th Internat. Computing and Information Conf.","first-page":"54","article-title":"Selectivity","author":"Hemachandra","year":"1993"},{"issue":"1","key":"10.1016\/0020-0190(95)00073-L_BIB10","first-page":"66","article-title":"P-selectivity: Intersections and indices","volume":"1","author":"Hemaspaandra","year":"1994","journal-title":"J. Comput. Inform."},{"key":"10.1016\/0020-0190(95)00073-L_BIB11","unstructured":"L. Hemachandra, A. Naik, M. Ogiwara and A. Selman, Computing solutions uniquely collapses the polynomial hierarchy, SIAM J. Comput., to appear."},{"issue":"2","key":"10.1016\/0020-0190(95)00073-L_BIB12","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. AMS"},{"key":"10.1016\/0020-0190(95)00073-L_BIB13","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."},{"key":"10.1016\/0020-0190(95)00073-L_BIB14","doi-asserted-by":"crossref","first-page":"11","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."},{"key":"10.1016\/0020-0190(95)00073-L_BIB15","article-title":"With what frequency are apparently intractable problems difficult?","author":"Meyer","year":"1979"},{"key":"10.1016\/0020-0190(95)00073-L_BIB16","series-title":"Proc. Structure in Complexity Theory Conf.","first-page":"52","article-title":"P-selective sets and reducing search to decision vs. self-reducibility","author":"Naik","year":"1993"},{"key":"10.1016\/0020-0190(95)00073-L_BIB17","series-title":"Proc. of Structure in Complexity Theory Conf.","first-page":"2","article-title":"Polynomial-time membership comparable sets","author":"Ogihara","year":"1994"},{"key":"10.1016\/0020-0190(95)00073-L_BIB18","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\/0020-0190(95)00073-L_BIB19","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0022-0000(81)90068-4","article-title":"Some observations on NP real numbers and p-selective sets","volume":"23","author":"Selman","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(95)00073-L_BIB20","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\/0020-0190(95)00073-L_BIB21","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. Comput. Sci."},{"key":"10.1016\/0020-0190(95)00073-L_BIB22","article-title":"On some central problems in computational complexity","author":"Simon","year":"1975"},{"key":"10.1016\/0020-0190(95)00073-L_BIB23","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/BF02090391","article-title":"On polynomial-time truth-table reducibilities of intractable set, to P-selective sets","volume":"24","author":"Toda","year":"1991","journal-title":"Math. Systems Theory"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500073L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500073L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T02:59:19Z","timestamp":1555297159000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500073L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["002001909500073L"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00073-l","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}