论文部分内容阅读
The problem of univariate polynomial approximate greatest common divisors(GCD)is a fundamental problem in the field of Symbolic-Numeric hybrid computation,and it is also important in some application fields.