On the computational complexity of imperative programming languages
type: Item
instance of: scholarly article
title: On the computational complexity of imperative programming languages
zbMATH Open document ID: 1048.03030
author: Yanyan Li
published in: Theoretical Computer Science
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 03D10
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68N15
zbMATH DE Number: 2083407
zbMATH Keywords: Implicit computational complexity
zbMATH Keywords: Imperative programming languages
zbMATH Keywords: Subrecursion theory
zbMATH Keywords: Grzegorczyk hierarchy
zbMATH Keywords: Polynomial-time computability
MaRDI profile type: Publication
full work available at URL: j.tcs.2003.10.016
OpenAlex ID: W2083350000
cites work: Q4850544
cites work: A new recursion-theoretic characterization of the polytime functions
cites work: Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited
cites work: Higher type recursion, ramification and polynomial time
cites work: Function-algebraic characterizations of log and polylog parallel time
cites work: Q4934292
cites work: Q4376046
cites work: The Structure of Loop Programs and Subrecursive Hierarchies
cites work: Q5824357
cites work: Q4035315
cites work: Q4850553
cites work: Q4501154
cites work: Q3142166
cites work: Q4474861
cites work: Augmented loop languages and classes of computable functions
cites work: The \(\mu\)-measure as a tool for classifying computational complexity
cites work: Q4339320
cites work: Hierarchies of Primitive Recursive Functions
cites work: Classes of Predictably Computable Functions
cites work: Q3325707
cites work: Rekursionszahlen und die Grzegorczyk-Hierarchie
cites work: The realm of primitive recursion
DOI: 10.1016/J.TCS.2003.10.016
description: scientific article; zbMATH DE number 2083407