Closure operations on measures of computational complexity

DOI10.1007/BF02575826zbMath0311.68034OpenAlexW2063820953MaRDI QIDQ1219561

Aldo De Luca, F. Adrianopoli

Publication date: 1974

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02575826

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Unnamed Item
• Unnamed Item
• Teorie della complessità di calcolo
• Gödel numberings of partial recursive functions
• A Machine-Independent Theory of the Complexity of Recursive Functions
• An Overview of the Theory of Computational Complexity

This page was built for publication: Closure operations on measures of computational complexity