A new sparse polynomial GCD by separating terms
From MaRDI portal
Cites work
- A fast parallel sparse polynomial GCD algorithm
- Algorithms for the non-monic case of the sparse modular GCD algorithm
- An improved EZ-GCD algorithm for multivariate polynomials
- Computing sparse GCD of multivariate polynomials via polynomial interpolation
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Fast construction of irreducible polynomials over finite fields
- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
- Greatest common divisors of polynomials given by straight-line programs
- scientific article; zbMATH DE number 3977110 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- scientific article; zbMATH DE number 1254256 (Why is no real title available?)
- Modern computer algebra
- Multivariate sparse interpolation using randomized Kronecker substitutions
- New Sparse Multivariate Polynomial Factorization Algorithms over Integers
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- On sparse interpolation of rational functions and gcds
- Revisit sparse polynomial interpolation based on randomized Kronecker substitution
- Subresultants and Reduced Polynomial Remainder Sequences
- The EEZ-GCD algorithm
- Three new algorithms for multivariate polynomial GCD
This page was built for publication: A new sparse polynomial GCD by separating terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033553)
