We consider the problem of computing the monic gcd of two polynomials over a number eld L = Q(1 ; : : : ; n ). Encarnacion, Langemyr and McCallum have already shown how Brown's modular GCD algorithm for polynomials over Q can be modified to work for Q(). Our firs
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit i...
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit i...
[[abstract]]In 1997, Calvez, Azou, and Vilbé proposed a variation on Euclidean algorithm, which can ...
We consider the problem of computing the monic gcd of two polyno-mials over a number field L = Q(α1,...
Let F = Q(t1,...,tk). For i, 1 <= i <= r, let mi(z1,..,zi) be a monic and irreducible polynomi...
AbstractModular methods for computing the gcd of two univariate polynomials over an algebraic number...
AbstractModular methods for computing the gcd of two univariate polynomials over an algebraic number...
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm fo...
Let L be an algebraic function field in k ≥ 0 parameters t1,..., tk. Let f1, f2 be non-zero polynomi...
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomia...
We consider a few modifications of the Big prime modular gcd algorithm for polynomials in Z[x]. Our ...
AbstractWe present a modular algorithm for computing the greatest common divisor of two polynomials ...
We study the following problem: Given a; b; N 2 F [x] with gcd(a; b; N) = 1 and N nonzero, compute a...
We report on several generic implementations for uni-variate polynomial gcd computation over the int...
AbstractIntermediate coefficient swell is a well-known difficulty with Buchberger’s algorithm for co...
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit i...
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit i...
[[abstract]]In 1997, Calvez, Azou, and Vilbé proposed a variation on Euclidean algorithm, which can ...
We consider the problem of computing the monic gcd of two polyno-mials over a number field L = Q(α1,...
Let F = Q(t1,...,tk). For i, 1 <= i <= r, let mi(z1,..,zi) be a monic and irreducible polynomi...
AbstractModular methods for computing the gcd of two univariate polynomials over an algebraic number...
AbstractModular methods for computing the gcd of two univariate polynomials over an algebraic number...
In this paper we study the generic setting of the modular GCD algorithm. We develop the algorithm fo...
Let L be an algebraic function field in k ≥ 0 parameters t1,..., tk. Let f1, f2 be non-zero polynomi...
We present a first sparse modular algorithm for computing a greatest common divisor of two polynomia...
We consider a few modifications of the Big prime modular gcd algorithm for polynomials in Z[x]. Our ...
AbstractWe present a modular algorithm for computing the greatest common divisor of two polynomials ...
We study the following problem: Given a; b; N 2 F [x] with gcd(a; b; N) = 1 and N nonzero, compute a...
We report on several generic implementations for uni-variate polynomial gcd computation over the int...
AbstractIntermediate coefficient swell is a well-known difficulty with Buchberger’s algorithm for co...
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit i...
This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit i...
[[abstract]]In 1997, Calvez, Azou, and Vilbé proposed a variation on Euclidean algorithm, which can ...
DOI
Add to ORKG