Absolute Factorization of Polynomials: A Geometric Approach
Dominique Duval · SIAM Journal on Computing · 1991
In this paper a new algorithm is presented for factoring bivariate polynomials over algebraically closed fields. Or, equivalently, for determining the irreducible components of a plane curve. This algorithm is based on properties of some geometric invariants of the curve, and is similar to Berlekamp’s algorithm for factorization of univariate polynomials over finite fields.