A Refinement of the μ-measure for Stack Programs

DOI10.1016/S1571-0661(03)00006-9zbMath1261.68059OpenAlexW2084958825MaRDI QIDQ4916234

Giovanni Pani, Emanuele Covino

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)00006-9

zbMATH Keywords

refinement\(\mu \)-measurestack programs

Mathematics Subject Classification ID

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

Cites Work

• A new recursion-theoretic characterization of the polytime functions
• LOGSPACE and PTIME characterized by programming languages
• Control structures in programs and computational complexity
• On the computational complexity of imperative programming languages
• The Garland Measure and Computational Complexity of Stack Programs
• The strength of non-size increasing computation
• Logical Approaches to Computational Barriers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Refinement of the μ-measure for Stack Programs