Relativization of the Theory of Computational Complexity
From MaRDI portal
Cites work
- A Classification of the Recursive Functions
- A Machine-Independent Theory of the Complexity of Recursive Functions
- An Overview of the Theory of Computational Complexity
- Augmented loop languages and classes of computable functions
- Classes of computable functions defined by bounds on computation
- Classes of Predictably Computable Functions
- Computational Complexity and the Existence of Complexity Gaps
- Computational speed-up by effective operators
- Degrees of Unsolvability. (AM-55)
- Gödel numberings of partial recursive functions
- Helping and the meet of pairs of honest subrecursive classes
- Hierarchies of Primitive Recursive Functions
- Honest bounds for complexity classes of recursive functions
- scientific article; zbMATH DE number 3131080 (Why is no real title available?)
- scientific article; zbMATH DE number 3305097 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- On a Subrecursive Hierarchy and Primitive Recursive Degrees
- On Effective Procedures for Speeding Up Algorithms
- Recursive Properties of Abstract Complexity Classes
- The Operator Gap
- Uniformly introreducible sets
- “Helping”: several formalizations
Cited in
(8)- On some natural complete operators
- A note on the best-case complexity
- Some results on relativized deterministic and nondeterministic time hierarchies
- On being incoherent without being very hard
- A comparison of polynomial time reducibilities
- Complete sets and the polynomial-time hierarchy
- Log space machines with multiple oracle tapes
- Results on memory-limited U-shaped learning
This page was built for publication: Relativization of the Theory of Computational Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4124321)
