Diagonalizing over deterministic polynomial time
- 1 January 1988
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Self-reducibilityPublished by Springer Nature ,2006
- Diagonalizations over polynomial time computable setsTheoretical Computer Science, 1987
- Honest polynomial degrees and P=? NPTheoretical Computer Science, 1987
- Recursively Enumerable Sets and DegreesPublished by Springer Nature ,1987
- P-mitotic setsLecture Notes in Computer Science, 1984
- Oracle-dependent properties of the lattice of NP setsTheoretical Computer Science, 1983
- Relativizations comparing NP and exponential timeInformation and Control, 1983
- Degrees of UnsolvabilityPublished by Springer Nature ,1983
- A uniform approach to obtain diagonal sets in complexity classesTheoretical Computer Science, 1982
- 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