Amir M. Ben-Amram. A complexity tradeoff in ranking-function termination proofs. Acta Informatica, 46(1):57-72, 2009. [doi]
@article{Ben-Amram09,
title = {A complexity tradeoff in ranking-function termination proofs},
author = {Amir M. Ben-Amram},
year = {2009},
doi = {10.1007/s00236-008-0085-0},
url = {http://dx.doi.org/10.1007/s00236-008-0085-0},
tags = {termination},
researchr = {https://researchr.org/publication/Ben-Amram09},
cites = {0},
citedby = {0},
journal = {Acta Informatica},
volume = {46},
number = {1},
pages = {57-72},
}