Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited
From MaRDI portal
Recommendations
Cited in
(18)- Implicit characterizations of FPTIME and NC revisited
- An inherently iterative algorithm for the Grzegorczyk hierarchy
- Higher type recursion, ramification and polynomial time
- The \(\mu\)-measure as a tool for classifying computational complexity
- Control structures in programs and computational complexity
- Separating NC along the \(\delta\) axis
- On the computational complexity of imperative programming languages
- Function operators spanning the arithmetical and the polynomial hierarchy
- Pure Iteration and Periodicity
- scientific article; zbMATH DE number 3557764 (Why is no real title available?)
- scientific article; zbMATH DE number 3557782 (Why is no real title available?)
- Grzegorcyk's hierarchy and IepΣ1
- Characterization of the Relations in Grzegorczyk's Hierarchy Revisited
- Some Hierarchies of Primitive Recursive Functions on Term Algebras
- scientific article; zbMATH DE number 1114016 (Why is no real title available?)
- scientific article; zbMATH DE number 806743 (Why is no real title available?)
- The Garland measure and computational complexity of stack programs
- scientific article; zbMATH DE number 1390026 (Why is no real title available?)
This page was built for publication: Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268889)