New Recombination Algorithms for Bivariate Polynomial Factorization Based on Hensel Lifting

Grégoire Lecerf (1)

1 LMV - Laboratoire de Mathématiques de Versailles

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.

Mots clés: Polynomial factorization; Hensel lifting

Domaines: Calcul formel [cs.SC]

Grégoire Lecerf. New Recombination Algorithms for Bivariate Polynomial Factorization Based on Hensel Lifting. Applicable Algebra in Engineering, Communication and Computing, 2010, 21 (2), pp.151-176. ⟨10.1007/s00200-010-0121-5⟩. ⟨hal-00157496⟩