A Numerical Absolute Primality Test for Bivariate Polynomials

We give a new numerical absolute primality criterion for bivariate polynomials. This test is based on a simple property of the monomials appearing after a generic linear change of coordinates. Our method also provides a probabilistic algorithm for detecting absolute factors. We sketch an implementation and give timings comparing with two other algorithms implemented in Maple.

• Type: Conference
• Year: 1997
• Where: ISSAC
• Authors: André Galligo, Stephen M. Watt
• Keywords: Absolute Primality Criterion, Bivariate Polynomials, Generic Linear Change, ISSAC 1997, Mathematics