Conference paper

Factorization of polynomials by transcendental evaluation

A new polynomial-time algorithm for the factorization of polynomials in two variables with rational coefficients is presented. The algorithm works by replacing one of the variables by an approximation of a transcendental number. It generalizes recent results by Kannan, Lenstra, Lovasz and Schonhage. Asymptotically the algorithm improves on the running times of previously published methods

Related material