925 search results - page 1 / 185 » A Solution to the Extended GCD Problem |
ISSAC
1995
Springer
13 years 8 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...
MFCS
1999
Springer
13 years 9 months ago
1999
Springer
ISSAC
2009
Springer
13 years 11 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
ISSAC
2007
Springer
13 years 10 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...