Three new algorithms for multivariate polynomial GCD
Journal of Symbolic Computation
Algorithms for computer algebra
Algorithms for computer algebra
Factoring high-degree polynomials by the black box Berlekamp algorithm
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Subresultants and Reduced Polynomial Remainder Sequences
Journal of the ACM (JACM)
On Euclid's Algorithm and the Theory of Subresultants
Journal of the ACM (JACM)
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Yet another practical implementation of polynomial factorization over finite fields
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
ACM '73 Proceedings of the ACM annual conference
Factorization of multivariate polynomials by extended Hensel construction
ACM SIGSAM Bulletin
ACM SIGSAM Bulletin
| Hi-index | 0.00 |
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.