Three new algorithms for multivariate polynomial GCD
Three algorithms for computing the GCD of multivariate polynomials are introduced. Based on the ideas presented by \textit{P. Gianni} and \textit{F. Trager} [Lect. Notes Comput. Sci. 204, 409-410 (1985)], the authors develop a different algorithm by calculating a Gröbner basis with a certain term ordering. The other two algorithms are developed based on the manipulation of some truncated power series. There are some comparisons with the currently existing GCD calculation algorithms given at the end of the paper.
scientific article; zbMATH DE number 64253