New recombination algorithms for bivariate polynomial factorization based on Hensel lifting

Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel lifting technique. For the dense bi-degree polynomial representation, the costs of our recombination algorithms are essentially sub-quadratic.

• Type: Journal
• Year: 2010
• Where: AAECC
• Authors: Grégoire Lecerf
• Keywords: AAECC 2010, Algorithms, Bi-degree Polynomial Representation, Bivariate Polynomial, Hensel Lifting Technique