This paper is devoted to present a deterministic algorithm computing the greatest common divisor of several univariate polynomials with coefficients in an integral domain with the best known complexity bound when integer coefficients are considered. More precisely, if n is a bound for the degree of the t+1 integer polynomials whose greatest common divisor is to be computed and M is a bound for the size of those polynomials then such greatest common divisor is computed by means of O(tn 3) arithmetic operations involving integers whose size is in O(n 4 M) (which is independent of t).
CITATION STYLE
González-Vega, L. (1995). On the complexity of computing the greatest common divisor of several univariate polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 911, pp. 332–345). Springer Verlag. https://doi.org/10.1007/3-540-59175-3_100
Mendeley helps you to discover research relevant for your work.