A new black box GCD algorithm using Hensel lifting
From MaRDI portal
Cites work
- A fast parallel sparse polynomial GCD algorithm
- A New Black Box Factorization Algorithm - the Non-monic Case
- A new sparse polynomial GCD by separating terms
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Fast interpolation of multivariate polynomials with sparse exponents
- 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 1254255 (Why is no real title available?)
- Interpolating polynomials from their values
- Linear Hensel lifting for \(\mathbb{F}_p[x,y]\) and \(\mathbb{Z}[x]\) with cubic cost
- Linear hensel lifting for zp[x,y] for \(n\) factors with cubic cost
- Maximal quotient rational reconstruction
- Modern computer algebra
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- On exact and approximate interpolation of sparse rational functions
- On sparse interpolation of rational functions and gcds
- P-adic reconstruction of rational numbers
- Sparse Hensel lifting algorithms for multivariate polynomial factorization. (Abstract of Doctoral Dissertation)
- Sparse interpolation of multivariate rational functions
- Sparse polynomial interpolation and division in soft-linear time
- The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects
- The EEZ-GCD algorithm
This page was built for publication: A new black box GCD algorithm using Hensel lifting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851533)
