Non-polynomial worst-case analysis of recursive programs (Q2164209)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7571369
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Non-polynomial worst-case analysis of recursive programs |
scientific article; zbMATH DE number 7571369 |
Statements
Non-polynomial worst-case analysis of recursive programs (English)
0 references
12 August 2022
0 references
recursive programs
0 references
worst-case bound
0 references
triple constraint
0 references
FLO11 expression
0 references
template variables
0 references
0.7078253030776978
0 references
0.7039200067520142
0 references
0.6981015801429749
0 references
0.6975493431091309
0 references
0.6943844556808472
0 references
