On the computational complexity of imperative programming languages (Q1827396)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the computational complexity of imperative programming languages |
scientific article; zbMATH DE number 2083407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational complexity of imperative programming languages |
scientific article; zbMATH DE number 2083407 |
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
0.8472042679786682
0 references
0.8321153521537781
0 references
0.8075435757637024
0 references
0.780771791934967
0 references
0.7547972798347473
0 references
