414 search results - page 1 / 83 » A parallel extended GCD algorithm |
JDA
2008
13 years 5 months ago
2008
A new parallel extended GCD algorithm is proposed. It matches the best existing parallel integer GCD algorithms of Sorenson and Chor and Goldreich, since it can be achieved in O (...
AICCSA
2001
IEEE
13 years 9 months ago
2001
IEEE
A new parallelization of Euclid's greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O(n/...
ISSAC
1995
Springer
13 years 9 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
ANTS
1998
Springer
13 years 10 months ago
1998
Springer
ISSAC
2007
Springer
13 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...