34 search results - page 5 / 7 » issac 2009 |
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we present an improved method for decomposing multivariate polynomials. This problem, also known as the Functional Decomposition Problem (FDP) [17, 9, 27], is class...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new...
ISSAC
2009
Springer
14 years 2 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...
ISSAC
2009
Springer
14 years 2 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 2 months ago
2009
Springer
We present algorithms and heuristics to compute the characteristic polynomial of a matrix given its minimal polynomial. The matrix is represented as a black-box, i.e., by a functi...