The Garland measure and computational complexity of stack programs

DOI10.1016/S1571-0661(03)00003-3MaRDI QIDQ4916233zbMATH OpenFDO

Authors

Publication date 19 April 2013

Published in Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S1571-0661(03)00003-3

zbMATH Keywords

control structuresexponential timeimperative languagesimplicit computational complexitypolynomial time

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the computational complexity of imperative programming languages
• Control structures in programs and computational complexity
• A Refinement of the μ-measure for Stack Programs
• scientific article; zbMATH DE number 1424029
• A note on the complexity of program evaluation

Cites work

• A new recursion-theoretic characterization of the polytime functions
• Higher type recursion, ramification and polynomial time
• scientific article; zbMATH DE number 3083488 (Why is no real title available?)
• Iteration of Primitive Recursion
• On the computational complexity of imperative programming languages
• Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited
• The \(\mu\)-measure as a tool for classifying computational complexity

Cited in

(3)

• Control structures in programs and computational complexity
• On the computational complexity of imperative programming languages
• A Refinement of the μ-measure for Stack Programs

This page was built for publication: The Garland measure and computational complexity of stack programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916233)