Sciweavers

1204 search results - page 24 / 241
» Termination of Polynomial Programs
Sort
View
80
Voted
DAGSTUHL
2007
14 years 11 months ago
Implementing RPO and POLO using SAT
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
Peter Schneider-Kamp, Carsten Fuhs, René Th...
54
Voted
ICALP
2010
Springer
15 years 2 months ago
Exponential Time Complexity of the Permanent and the Tutte Polynomial
Holger Dell, Thore Husfeldt, Martin Wahlen
ICALP
1995
Springer
15 years 1 months ago
Polynomial Closure and Unambiguous Product
Jean-Eric Pin, Pascal Weil