This paper presents a new efficient algorithm for the GCD ... We propose a new algorithm for computing the GCD of t- wo parametric multivariate polynomials.

Jul 11, 2018 · The algorithm is based on a well-known simple insight that the GCD of two multivariate polynomials (non-parametric as well as parametric) can be ...

ABSTRACT. A new efficient algorithm for computing a parametric greatest common divisor (GCD) of parametric multivariate polyno-.

J. Moses and D.Y.Y. Yun: The EZ GCD algorithm. In Proceedings of ACM' 73,. ACM Press, New York, 1973, 159-166. (Hensel lifting).

A new efficient algorithm for computing a parametric greatest common divisor (GCD) of parametric multivariate polynomials over k[u][x] is presented.

Jul 24, 2019 · Two new efficient algorithms for computing greatest common divisors (gcds) of parametric mul- tivariate polynomials over k[U][X] are presented.

An extended greatest common divisor (GCD) algorithm for parametric univariate polynomials is presented, and the proposed extended GCD algorithm is applied ...

This paper presents two new efficient algorithms for the gcd computation of parametric multivariate polynomials. We first consider the non-parametric case ...

The algorithm is based on a well-known simple insight that the GCD of two multivariate polynomials (non-parametric as well as parametric) can be extracted using ...

Deepak Kapur, Dong Lu, Michael B. Monagan, Yao Sun, Dingkang Wang: An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD.