Some observations on NP real numbers and P-selective sets
- 31 December 1981
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 23 (3) , 326-332
- https://doi.org/10.1016/0022-0000(81)90068-4
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the definitions of some complexity classes of real numbersTheory of Computing Systems, 1983
- Reductions on NP and P-selective setsTheoretical Computer Science, 1982
- The maximum value problem and NP real numbersJournal of Computer and System Sciences, 1982
- Some connections between nonuniform and uniform complexity classesPublished by Association for Computing Machinery (ACM) ,1980
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNPTheory of Computing Systems, 1979
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- Tally languages and complexity classesInformation and Control, 1974
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972
- Semirecursive sets and positive reducibilityTransactions of the American Mathematical Society, 1968
- Recursively enumerable sets of positive integers and their decision problemsBulletin of the American Mathematical Society, 1944