Abstract computational complexity and cycling computations

DOI10.1016/S0022-0000(71)80030-2zbMath0225.02025MaRDI QIDQ2548594

Giorgio Ausiello

Publication date: 1971

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

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15)

Related Items (4)

Unnamed Item ⋮ Complexity classes of provable recursive functions ⋮ COMPLEXITY OF DESCRIPTIONS OF SYSTEMS: A FOUNDATIONAL STUDY ⋮ Unnamed Item

Cites Work

• The enumerability and invariance of complexity classes
• Classes of computable functions defined by bounds on computation
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Computational Complexity and the Existence of Complexity Gaps
• Recursive Properties of Abstract Complexity Classes
• Unnamed Item

This page was built for publication: Abstract computational complexity and cycling computations