A note on complete problems for complexity classes
- 24 November 1986
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 23 (5) , 227-230
- https://doi.org/10.1016/0020-0190(86)90078-5
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the complexity of unique solutionsJournal of the ACM, 1984
- Strong reducibilitiesBulletin of the American Mathematical Society, 1981
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNPTheory of Computing Systems, 1979
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- A comparison of polynomial time reducibilitiesTheoretical Computer Science, 1975
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975