Towards factoring bivariate approximate polynomials
Robert M. Corless, Mark W. Giesbrecht, Mark van Hoeij, Ilias Kotsireas, Stephen M. Watt · 2001
A new algorithm is presented for factoring bivariate approximate polynomials over C[x, y]. Given a particular polynomial, the method constructs a nearby composite polynomial, if one exists, and its irreducible factors. Subject to a conjecture, the time to produce the factors is polynomial in the degree of the problem. This method has been implemented in Maple, and has been demonstrated to be efficient and numerically robust.