Algorithms for the non-monic case of the sparse modular GCD algorithm
DOI10.1145/1073884.1073903zbMATH Open1360.11145OpenAlexW1970815075MaRDI QIDQ5262753FDOQ5262753
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
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
probabilistic algorithmsmodular algorithmsZippel's algorithmsparse multivariate polynomialspolynomial greatest common divisors
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16)
Cited In (10)
- Enhancing the Extended Hensel Construction by Using Gröbner Bases
- Computing sparse GCD of multivariate polynomials via polynomial interpolation
- Some results on counting roots of polynomials and the Sylvester resultant
- A sparse modular GCD algorithm for polynomials over algebraic function fields
- A fast parallel sparse polynomial GCD algorithm
- 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
- Sparse polynomial interpolation based on diversification
- Parallelization of triangular decompositions: techniques and implementation
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)
