ISSAC
2009
Springer
14 years 6 months ago
2009
Springer
We study systems of higher-order linear differential equations having a regular singularity at the origin. Using the properties of matrix polynomials, we develop efficient method...
ISSAC
2009
Springer
14 years 6 months ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
ISSAC
2009
Springer
14 years 6 months ago
2009
Springer
ISSAC
2009
Springer
14 years 6 months ago
2009
Springer
We describe a new LLL-type algorithm, H-LLL, that relies on Householder transformations to approximate the underlying Gram-Schmidt orthogonalizations. The latter computations are ...
ISSAC
2009
Springer
14 years 6 months ago
2009
Springer
In this paper we report on an experience communicating two computer algebra systems, namely GAP (and more concretely, its HAP package to compute in Homological Algebra) and Kenzo ...
ISSAC
2009
Springer
14 years 6 months ago
2009
Springer
ISSAC
2009
Springer
14 years 6 months ago
2009
Springer
Cylindrical algebraic decomposition is one of the most important tools for computing with semi-algebraic sets, while triangular decomposition is among the most important approache...
ISSAC
2009
Springer
14 years 6 months ago
2009
Springer
ISSAC
2009
Springer
14 years 6 months ago
2009
Springer
We address complexity issues for linear differential equations in characteristic p > 0: resolution and computation of the p-curvature. For these tasks, our main focus is on al...
ISSAC
2009
Springer
14 years 6 months ago
2009
Springer
We present a high performance algorithm for multiplying sparse distributed polynomials using a multicore processor. Each core uses a heap of pointers to multiply parts of the poly...