A characterization of complexity sequences
From MaRDI portal
Publication:4067076
DOI10.1002/MALQ.19750210106zbMath0309.02033OpenAlexW2167636857MaRDI QIDQ4067076
G. Stumpf, Claus Peter Schnorr
Publication date: 1975
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19750210106
Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10) Algorithms in computer science (68W99)
Related Items (5)
Characterization of realizable space complexities ⋮ Computational complexity of functions ⋮ Speedup for natural problems and noncomputability ⋮ The complexity types of computable sets ⋮ Some applications of the McCreight-Meyer algorithm in abstract complexity theory
This page was built for publication: A characterization of complexity sequences