Strong nondeterministic polynomial-time reducibilities
- 31 October 1982
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 21 (1) , 1-25
- https://doi.org/10.1016/0304-3975(82)90085-8
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Reductions on NP and P-selective setsTheoretical Computer Science, 1982
- On γ-reducibility versus polynomial time many-one reducibilityTheoretical Computer Science, 1981
- Polynomial Time Enumeration ReducibilitySIAM Journal on Computing, 1978
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Relative complexity of checking and evaluatingInformation Processing Letters, 1976
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975