Algorithms for the non-monic case of the sparse modular GCD algorithm

DOI10.1145/1073884.1073903zbMath1360.11145OpenAlexW1970815075MaRDI QIDQ5262753

Allan D. Wittkopf, Jennifer de Kleine, Michael B. Monagan

Publication date: 16 July 2015

Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1073884.1073903

zbMATH Keywords

probabilistic algorithmsmodular algorithmsZippel's algorithmsparse multivariate polynomialspolynomial greatest common divisors

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)

Related Items (9)

Computing sparse GCD of multivariate polynomials via polynomial interpolation ⋮ Sparse polynomial interpolation based on diversification ⋮ Parallelization of triangular decompositions: techniques and implementation ⋮ Balancing act: multivariate rational reconstruction for IBP ⋮ Sparse interpolation of multivariate rational functions ⋮ A fast parallel sparse polynomial GCD algorithm ⋮ A new algorithm for computing the extended Hensel construction of multivariate polynomials ⋮ Some results on counting roots of polynomials and the Sylvester resultant ⋮ Enhancing the Extended Hensel Construction by Using Gröbner Bases

This page was built for publication: Algorithms for the non-monic case of the sparse modular GCD algorithm