Sharp precision in Hensel lifting for bivariate polynomial factorization

DOI10.1090/S0025-5718-06-01810-2zbMath1125.12003OpenAlexW2052670035MaRDI QIDQ3377003

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials, factorization in commutative rings (13P05) Factorization (11Y05)

Related Items

Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations, Lifting and recombination techniques for absolute factorization, Modular Las Vegas algorithms for polynomial absolute factorization, A lifting and recombination algorithm for rational factorization of sparse polynomials, Bivariate factorization using a critical fiber, Symbolic computations of first integrals for polynomial vector fields, Fast separable factorization and applications, A concise proof of the Kronecker polynomial system solver from scratch, Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time, A note on Gao's algorithm for polynomial factorization, Sparse bivariate polynomial factorization, Improved dense multivariate polynomial factorization algorithms, A pre-test for factoring bivariate polynomials with coefficients in \(\mathbb F_2\), New recombination algorithms for bivariate polynomial factorization based on Hensel lifting, Primary decomposition of zero-dimensional ideals over finite fields, Nearly optimal algorithms for the decomposition of multivariate rational functions and the extended Lüroth theorem, Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields, A recombination algorithm for the decomposition of multivariate rational functions, Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A unified method for multivariate polynomial factorizations
• Factoring polynomials over global fields
• Approximate factorization of multivariate polynomials and absolute irreducibility testing
• Analysis of approximate factorization algorithm. I
• Reducibility of polynomials \(f(x,y)\) modulo \(p\)
• A new efficient factorization algorithm for polynomials over small finite fields
• On Hensel factorization. I
• Hensel lifting and bivariate polynomial factorisation over finite fields
• Reduzibilität ebener Kurven.
• Multivariate Polynomial Factorization
• Factoring Multivariate Polynomials over Algebraic Number Fields
• Complexity issues in bivariate polynomial factorization
• Factoring multivariate polynomials via partial differential equations
• Absolute irreducibility of polynomials via Newton polytopes