185
click to vote
ISSAC
15 years 11 months ago
2007 Springer 
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomials f1, f2 ∈ L[x] where L is an algebraic function field in k ≥ 0 paramete...
137
click to vote
ISSAC
15 years 11 months ago
2007 Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
126
Voted
ISSAC
15 years 11 months ago
2007 Springer 
In this paper, we describe the design of a C library named PTPol implementing arithmetic operations for univariate polynomials and report on practical experiments showing the rele...
151
click to vote
ISSAC
15 years 11 months ago
2007 Springer
We report on a high-level categorical parallel framework, written in the Aldor language, to support high-performance computer algebra on symmetric multi-processors and multicore p...
ISSAC
15 years 11 months ago
2007 Springer  |
Mathematics