A complexity tradeoff in ranking-function termination proofs (Q1006896)
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 5533206
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complexity tradeoff in ranking-function termination proofs |
scientific article; zbMATH DE number 5533206 |
Statements
A complexity tradeoff in ranking-function termination proofs (English)
0 references
26 March 2009
0 references
size-change termination
0 references
0.8690314292907715
0 references
0.8106916546821594
0 references
0.7987139225006104
0 references
0.7965843081474304
0 references
