A uniform approach to obtain diagonal sets in complexity classes
- 30 April 1982
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 18 (1), 95-103
- https://doi.org/10.1016/0304-3975(82)90114-1
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Strong nondeterministic polynomial-time reducibilitiesTheoretical Computer Science, 1982
- On the structure of sets in NP and other complexity classesTheoretical Computer Science, 1981
- A note on structure and looking back applied to the relative complexity of computable functionsJournal of Computer and System Sciences, 1981
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNPTheory of Computing Systems, 1979
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971