Twenty questions to a p-selector
Authors:
- Harry BuhrmanHBHarry Buhrman
- Leen TorenvlietLTLeen Torenvliet
- Peter van Emde BoasPBPeter van Emde Boas
- 1 November 1993
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 48 (4) , 201-204
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- On self-reducibility and weak P-selectivityJournal of Computer and System Sciences, 1983
- Analogues of semirecursive sets and effective reducibilities to the study of NP complexityInformation and Control, 1982
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNPTheory of Computing Systems, 1979
- tt- andm-degreesAlgebra and Logic, 1973
- Semirecursive sets and positive reducibilityTransactions of the American Mathematical Society, 1968
- A theorem on hyperhypersimple setsThe Journal of Symbolic Logic, 1963
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)Proceedings of the National Academy of Sciences, 1957