Degrees of computational complexity

DOI10.1016/S0022-0000(72)80010-2MaRDI QIDQ2557123zbMATH OpenFDO

Authors Herbert B. Enderton

Publication date 1972

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0022-0000(72)80010-2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• A note on dense and nondense families of complexity classes
• An Overview of the Theory of Computational Complexity
• Classes of computable functions defined by bounds on computation
• scientific article; zbMATH DE number 3307591 (Why is no real title available?)
• scientific article; zbMATH DE number 3198867 (Why is no real title available?)

Cited in

(4)

• Complexity of algorithms and computations
• An operator embedding theorem for complexity classes of recursive functions
• On computational reducibility
• Toward a mathematical theory of graph-generative systems and its applications

This page was built for publication: Degrees of computational complexity

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