Computational complexity of functions

DOI10.1016/0304-3975(95)00163-8zbMath0871.68097arXiv1411.3010OpenAlexW1969523992MaRDI QIDQ1351510

Leonid A. Levin

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.3010

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Characterization of realizable space complexities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Halting space-bounded computations
• Characterization of realizable space complexities
• A characterization of complexity sequences
• “Helping”: several formalizations
• On the Computational Complexity of Algorithms
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Computational speed-up by effective operators

This page was built for publication: Computational complexity of functions