Sciweavers

1204 search results - page 24 / 241
» Termination of Polynomial Programs
Sort
View
95
Voted
DAGSTUHL
2007
15 years 1 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...
65
Voted
ICALP
2010
Springer
15 years 5 months ago
Exponential Time Complexity of the Permanent and the Tutte Polynomial
Holger Dell, Thore Husfeldt, Martin Wahlen
69
Voted
ICALP
2010
Springer
15 years 5 months ago
On LR(k)-Parsers of Polynomial Size
Norbert Blum
76
Voted
ICALP
1995
Springer
15 years 4 months ago
Polynomial Closure and Unambiguous Product
Jean-Eric Pin, Pascal Weil