167
click to vote
CASC
15 years 5 months ago
2009 Springer 
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
132
click to vote
CASC
15 years 11 months ago
2009 Springer 
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
159
click to vote
CASC
15 years 11 months ago
2009 Springer 
We discuss the family of “divide-and-conquer” algorithms for polynomial multiplication, that generalize Karatsuba’s algorithm. We give explicit versions of transposed and sho...
|
Mathematics