1204 search results - page 35 / 241 » Termination of Polynomial Programs |
LOPSTR
2009
Springer
14 years 5 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We reprove that the approximate degree of the OR function on n bits is ( n). We consider a linear program which is feasible if and only if there is an approximate polynomial for ...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
ISAAC
2010
Springer
13 years 9 months ago
2010
Springer
We study polynomial time complexity of type 2 functionals. For that purpose, we introduce a first order functional stream language. We give criteria, named well-founded, on such pr...
IPL
2006
13 years 11 months ago
2006
This paper gives a constructive proof that the register allocation problem for a uniform register set is solvable in polynomial time for SSA-form programs. 2006 Elsevier B.V. All ...