The Garland measure and computational complexity of stack programs (Q4916233)
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: The Garland measure and computational complexity of stack programs |
scientific article; zbMATH DE number 6156042
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Garland measure and computational complexity of stack programs |
scientific article; zbMATH DE number 6156042 |
Statements
The Garland Measure and Computational Complexity of Stack Programs (English)
0 references
19 April 2013
0 references
implicit computational complexity
0 references
control structures
0 references
imperative languages
0 references
polynomial time
0 references
exponential time
0 references
0.8321153521537781
0 references
0.7980343699455261
0 references
0.7933088541030884
0 references
0.6858551502227783
0 references
