The \(\mu\)-measure as a tool for classifying computational complexity

DOI10.1007/s001530050163zbMath0964.03041OpenAlexW2043102901MaRDI QIDQ1590662

Karl-Heinz Niggl

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

zbMATH Keywords

computational complexityGrzegorczyk classesprimitive recursive functionspolynomial time computable functionsHeinermann classsimply typed term systems

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Grammars and rewriting systems (68Q42) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (5)

The Garland Measure and Computational Complexity of Stack Programs ⋮ Control structures in programs and computational complexity ⋮ Separating NC along the \(\delta\) axis ⋮ On the computational complexity of imperative programming languages ⋮ Implicit characterizations of FPTIME and NC revisited

This page was built for publication: The \(\mu\)-measure as a tool for classifying computational complexity