CASC
2009
Springer
13 years 9 months ago
2009
Springer
CASC
2009
Springer
14 years 19 days 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...
CASC
2009
Springer
14 years 2 months ago
2009
Springer
CASC
2009
Springer
14 years 3 months ago
2009
Springer
CASC
2009
Springer
14 years 6 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...
CASC
2009
Springer
14 years 6 months ago
2009
Springer
We present lazy and forgetful algorithms for adding, multiplying and dividing multivariate polynomials. The lazy property allows us to compute the i-th term of a polynomial withou...
CASC
2009
Springer
14 years 6 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...
CASC
2009
Springer
14 years 6 months ago
2009
Springer
CASC
2009
Springer
14 years 6 months ago
2009
Springer
CASC
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We describe a symbolic framework for treating linear boundary problems with a generic implementation in the Theorema system. For ordinary differential equations, the ope...