Diagonalisation methods in a polynomial setting
- 1 January 1986
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Separating, strongly separating, and collapsing relativized complexity classesPublished by Springer Nature ,2006
- On sparse oracles separating feasible complexity classesPublished by Springer Nature ,1986
- Simplicity, Relativizations and NondeterminismSIAM Journal on Computing, 1985
- Oracle-dependent properties of the lattice of NP setsTheoretical Computer Science, 1983
- 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
- Refining Nondeterminism in Relativized Polynomial-Time Bounded ComputationsSIAM Journal on Computing, 1980
- A second step toward the polynomial hierarchyTheoretical Computer Science, 1979
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- Recursive predicates and quantifiersTransactions of the American Mathematical Society, 1943