The Garland Measure and Computational Complexity of Stack Programs

DOI10.1016/S1571-0661(03)00003-3zbMath1261.68061MaRDI QIDQ4916233

No author found.

Publication date: 19 April 2013

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

zbMATH Keywords

polynomial timecontrol structuresimplicit computational complexityexponential timeimperative languages

Mathematics Subject Classification ID

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

Related Items (2)

A Refinement of the μ-measure for Stack Programs ⋮ Control structures in programs and computational complexity

Cites Work

• Unnamed Item
• A new recursion-theoretic characterization of the polytime functions
• Higher type recursion, ramification and polynomial time
• The \(\mu\)-measure as a tool for classifying computational complexity
• On the computational complexity of imperative programming languages
• Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited
• Iteration of Primitive Recursion

This page was built for publication: The Garland Measure and Computational Complexity of Stack Programs