An improved EZ-GCD algorithm for multivariate polynomials

The EZ-GCD algorithm often has the bad-zero problem, which has a remarkable influence on polynomials with higher-degree terms. In this paper, by applying special ideals, the EZ-GCD algorithm for sparse polynomials is improved. This improved algorithm greatly reduces computational complexity because of the sparseness of polynomials. The author expects that the use of these ideals will be useful as a resolution for obtaining a GCD of sparse multivariate polynomials with higher-degree terms.