3 citations · 3 across the 1 of their papers we have counts for
1 paper
Amir M. Ben-Amram, Michael Vainer
Intuitively, if we can prove that a program terminates, we expect some conclusion regarding its complexity. But the passage from termination proofs to complexity bounds is not alwa…