The \(\mu\)-measure as a tool for classifying computational complexity
From MaRDI portal
Publication:1590662
DOI10.1007/s001530050163zbMath0964.03041MaRDI QIDQ1590662
Publication date: 16 July 2001
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001530050163
computational complexity; Grzegorczyk classes; primitive recursive functions; polynomial time computable functions; Heinermann class; simply typed term systems
03D15: Complexity of computation (including implicit computational complexity)
68Q42: Grammars and rewriting systems
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
03D20: Recursive functions and relations, subrecursive hierarchies
Related Items
The Garland Measure and Computational Complexity of Stack Programs, Implicit characterizations of FPTIME and NC revisited, Control structures in programs and computational complexity, Separating NC along the \(\delta\) axis, On the computational complexity of imperative programming languages