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

DOI10.1145/1073884.1073903MaRDI QIDQ5262753zbMATH OpenOpenAlexFDO

Authors Jennifer de Kleine, Allan D. Wittkopf, Michael 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)

Recommendations

• A sparse modular GCD algorithm for polynomials over algebraic function fields
• A fast parallel sparse polynomial GCD algorithm
• A fast parallel sparse polynomial GCD algorithm
• Polynomial greatest common divisor as a solution of system of linear equations
• Irreducibility and greatest common divisor algorithms for sparse polynomials

Cited in

(10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262753)