Sharp precision in Hensel lifting for bivariate polynomial factorization
DOI10.1090/S0025-5718-06-01810-2zbMATH Open1125.12003OpenAlexW2052670035MaRDI QIDQ3377003FDOQ3377003
Authors: Grégoire Lecerf
Publication date: 27 March 2006
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-06-01810-2
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
Symbolic computation and algebraic computation (68W30) Factorization (11Y05) Number-theoretic algorithms; complexity (11Y16) Polynomials, factorization in commutative rings (13P05)
Cites Work
- Absolute irreducibility of polynomials via Newton polytopes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reducibility of polynomials \(f(x,y)\) modulo \(p\)
- Title not available (Why is that?)
- Reduzibilität ebener Kurven.
- Factoring multivariate polynomials via partial differential equations
- Factoring polynomials over global fields
- On Hensel factorization. I
- Approximate factorization of multivariate polynomials and absolute irreducibility testing
- Analysis of approximate factorization algorithm. I
- Multivariate Polynomial Factorization
- Complexity issues in bivariate polynomial factorization
- A unified method for multivariate polynomial factorizations
- A new efficient factorization algorithm for polynomials over small finite fields
- Factoring Multivariate Polynomials over Algebraic Number Fields
- Hensel lifting and bivariate polynomial factorisation over finite fields
Cited In (22)
- A concise proof of the Kronecker polynomial system solver from scratch
- Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields
- Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
- Hensel lifting and bivariate polynomial factorisation over finite fields
- Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem
- A lifting and recombination algorithm for rational factorization of sparse polynomials
- A recombination algorithm for the decomposition of multivariate rational functions
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
- Primary decomposition of zero-dimensional ideals over finite fields
- Modular Las Vegas algorithms for polynomial absolute factorization
- Complexity issues in bivariate polynomial factorization
- Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
- Sparse bivariate polynomial factorization
- A note on Gao's algorithm for polynomial factorization
- Bivariate factorization using a critical fiber
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Lifting and recombination techniques for absolute factorization
- Improved dense multivariate polynomial factorization algorithms
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- Fast separable factorization and applications
- A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\)
- Symbolic computations of first integrals for polynomial vector fields
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)