In this paper,An improved Euclidean algorithm for computing the greatest common divisor of two polynomials is presented. We improve the recursive procedure EMGCD to determine the computational complexity of Euclidean algorithm.

• 本文对用于求两个多项式的最大公约多项式的欧几里德算法作了改进，主要改进了决定该算法计算复杂性的EMGCD的递归过程。