P-mitotic sets
- 1 January 1984
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the structure of sets in NP and other complexity classesTheoretical Computer Science, 1981
- On Isomorphisms and Density of $NP$ and Other Complete SetsSIAM Journal on Computing, 1977
- 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
- Mitotic recursively enumerable setsThe Journal of Symbolic Logic, 1973
- A completely mitotic nonrecursive r.e. degreeTransactions of the American Mathematical Society, 1973
- The Priority Method IMathematical Logic Quarterly, 1967