Diagonalizations over polynomial time computable sets
- 31 December 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 51 (1-2) , 177-204
- https://doi.org/10.1016/0304-3975(87)90053-3
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Oracle-dependent properties of the lattice of NP setsTheoretical Computer Science, 1983
- Recursively enumerable generic setsThe Journal of Symbolic Logic, 1982
- A uniform approach to obtain diagonal sets in complexity classesTheoretical 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
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- Indexings of subrecursive classesTheoretical Computer Science, 1980
- 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