On the cutting edge of relativization: The resource bounded injury method
From MaRDI portal
(Redirected from Publication:4632432)
On the cutting edge of relativization: the resource bounded injury method
On the cutting edge of relativization: the resource bounded injury method
Recommendations
Cites work
- A Turing machine time hierarchy
- Distinguishing conjunctive and disjunctive reducibilities by sparse sets
- scientific article; zbMATH DE number 3117565 (Why is no real title available?)
- scientific article; zbMATH DE number 3988707 (Why is no real title available?)
- scientific article; zbMATH DE number 192916 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1256638 (Why is no real title available?)
- IP = PSPACE
- On relativized exponential and probabilistic complexity classes
- On Relativized Polynomial and Exponential Computations
- On the Computational Complexity of Algorithms
- On the random oracle hypothesis
- On truth-table reducibility to SAT
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
- Separating Nondeterministic Time Complexity Classes
- Sparse sets in NP-P: EXPTIME versus NEXPTIME
- The polynomial-time hierarchy
- The strong exponential hierarchy collapses
- TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
Cited in
(4)
This page was built for publication: On the cutting edge of relativization: The resource bounded injury method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632432)
