Sciweavers

JSC
2010
90views more  JSC 2010»
13 years 3 months ago
Modular Las Vegas algorithms for polynomial absolute factorization
Let f(X, Y ) ∈ Z[X, Y ] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely,...
Cristina Bertone, Guillaume Chèze, Andr&eac...