A complexity tradeoff in ranking-function termination proofs

Amir M. Ben-Amram. A complexity tradeoff in ranking-function termination proofs. Acta Informatica, 46(1):57-72, 2009. [doi]

Abstract

Abstract is missing.