{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:33:54Z","timestamp":1757543634546},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":[[1993,11]]},"DOI":"10.1016\/0020-0190(93)90146-z","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"201-204","source":"Crossref","is-referenced-by-count":12,"title":["Twenty questions to a p-selector"],"prefix":"10.1016","volume":"48","author":[{"given":"Harry","family":"Buhrman","sequence":"first","affiliation":[]},{"given":"Leen","family":"Torenvliet","sequence":"additional","affiliation":[]},{"given":"Peter","family":"van Emde Boas","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90146-Z_BIB1","series-title":"Structural Complexity I","author":"Balc\u00e1zar","year":"1988"},{"key":"10.1016\/0020-0190(93)90146-Z_BIB2","series-title":"8th Ann. Conf. on Proc. Structure in Complexity Theory","first-page":"44","article-title":"Selective self-reducible sets: A new characterization of P","author":"Buhrman","year":"1993"},{"key":"10.1016\/0020-0190(93)90146-Z_BIB3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02219290","article-title":"tt and m-degrees","volume":"12","author":"Degtev","year":"1973","journal-title":"Algebra and Logic"},{"key":"10.1016\/0020-0190(93)90146-Z_BIB4","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1073\/pnas.43.2.236","article-title":"Two recursively enumerable sets of incomparable degrees of unsolvability","volume":"43","author":"Friedberg","year":"1957","journal-title":"Proc. Nat. Acad. Sci."},{"key":"10.1016\/0020-0190(93)90146-Z_BIB5","series-title":"PhD thesis","article-title":"Reducibilities in recursive function theory","author":"Jockusch","year":"1966"},{"key":"10.1016\/0020-0190(93)90146-Z_BIB6","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\/0020-0190(93)90146-Z_BIB7","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(93)90146-Z_BIB8","doi-asserted-by":"crossref","first-page":"273","DOI":"10.2307\/2271305","article-title":"A theorem on hypersimple sets","volume":"28","author":"Martin","year":"1963","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0020-0190(93)90146-Z_BIB9","first-page":"473","article-title":"One class of partial sets","volume":"20","author":"Marchenkov","year":"1976","journal-title":"Mat. Zametki"},{"key":"10.1016\/0020-0190(93)90146-Z_BIB10","series-title":"Tech. Rept. MIT\/LCS\/TM-126","article-title":"With what frequency are apparently intractable problem difficult?","author":"Meyer","year":"1979"},{"key":"10.1016\/0020-0190(93)90146-Z_BIB11","first-page":"194","article-title":"Negative answer to the problem of reducibility in the theory of algorithms","volume":"108","author":"Muchnik","year":"1956","journal-title":"Dokl. Acad. Nauk SSSR"},{"key":"10.1016\/0020-0190(93)90146-Z_BIB12","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"},{"issue":"1","key":"10.1016\/0020-0190(93)90146-Z_BIB13","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/S0019-9958(82)80084-3","article-title":"Analogues of semicursive sets and effective reducibilities to the study of NP complexity","volume":"52","author":"Selman","year":"1982","journal-title":"Inform. and Control"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390146Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390146Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:28:37Z","timestamp":1555129717000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390146Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["002001909390146Z"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90146-z","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}