Searching for "A complexity tradeoff in ranking-function termination proofs." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

A complexity tradeoff in ranking-function termination proofs. submitted for publication
by Amir M. Ben-amram — 2007
…A Complexity Tradeoff in Ranking-Function Termination Proofs Amir M. Ben-Amram ∗ June 3, 2007…
Cited by 1 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB