On the computational complexity of imperative programming languages (Q1827396)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of imperative programming languages |
scientific article |
Statements
On the computational complexity of imperative programming languages (English)
0 references
6 August 2004
0 references
Implicit computational complexity
0 references
Imperative programming languages
0 references
Subrecursion theory
0 references
Grzegorczyk hierarchy
0 references
Polynomial-time computability
0 references
