Degrees of computational complexity

DOI10.1016/S0022-0000(72)80010-2zbMath0251.68029MaRDI QIDQ2557123

H. B. Enderton

Publication date: 1972

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (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

Cites Work

• Unnamed Item
• Unnamed Item
• Classes of computable functions defined by bounds on computation
• 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

This page was built for publication: Degrees of computational complexity