Honest bounds for complexity classes of recursive functions

DOI10.2307/2272353MaRDI QIDQ4083408zbMATH OpenOpenAlexFDO

Authors

Publication date 1974

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2272353

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites work

• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• A Machine-Independent Theory of the Complexity of Recursive Functions
• An Overview of the Theory of Computational Complexity
• Computational Complexity and the Existence of Complexity Gaps
• Recursive Properties of Abstract Complexity Classes
• The Operator Gap

Cited in

(4)

• Easy Constructions in Complexity Theory: Gap and Speed-Up Theorems
• Some applications of the McCreight-Meyer algorithm in abstract complexity theory
• Relativization of the Theory of Computational Complexity
• The non-renamability of honesty classes

This page was built for publication: Honest bounds for complexity classes of recursive functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4083408)