Sharp precision in Hensel lifting for bivariate polynomial factorization
From MaRDI portal
Publication:3377003
Recommendations
- New bivariate Hensel lifting algorithm for n factors
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Hensel lifting and bivariate polynomial factorisation over finite fields
- Towards factoring bivariate approximate polynomials
- Polynomial factorization: Sharp bounds, efficient algorithms
- The complexity of sparse Hensel lifting and sparse polynomial factorization
- The complexity and parallel implementation of two sparse multivariate Hensel lifting algorithms for polynomial factorization
- scientific article; zbMATH DE number 1262433
- Factorization of multivariate polynomials by extended Hensel construction
- Factorization of bivariate sparse polynomials
Cites work
- scientific article; zbMATH DE number 481965 (Why is no real title available?)
- scientific article; zbMATH DE number 1936673 (Why is no real title available?)
- scientific article; zbMATH DE number 2151173 (Why is no real title available?)
- A new efficient factorization algorithm for polynomials over small finite fields
- A unified method for multivariate polynomial factorizations
- Absolute irreducibility of polynomials via Newton polytopes
- Analysis of approximate factorization algorithm. I
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Complexity issues in bivariate polynomial factorization
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Factoring multivariate polynomials via partial differential equations
- Factoring polynomials over global fields
- Hensel lifting and bivariate polynomial factorisation over finite fields
- Multivariate Polynomial Factorization
- On Hensel factorization. I
- Reducibility of polynomials \(f(x,y)\) modulo \(p\)
- Reduzibilität ebener Kurven.
Cited in
(22)- A note on Gao's algorithm for polynomial factorization
- Primary decomposition of zero-dimensional ideals over finite fields
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
- Hensel lifting and bivariate polynomial factorisation over finite fields
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- A lifting and recombination algorithm for rational factorization of sparse polynomials
- A recombination algorithm for the decomposition of multivariate rational functions
- A concise proof of the Kronecker polynomial system solver from scratch
- Modular Las Vegas algorithms for polynomial absolute factorization
- Bivariate factorization using a critical fiber
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- Improved dense multivariate polynomial factorization algorithms
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
- Fast separable factorization and applications
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)
- Lifting and recombination techniques for absolute factorization
- Symbolic computations of first integrals for polynomial vector fields
- Complexity issues in bivariate polynomial factorization
- Sparse bivariate polynomial factorization
This page was built for publication: Sharp precision in Hensel lifting for bivariate polynomial factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3377003)
