Modular Las Vegas Algorithms for Polynomial Absolute Factorization

Details Modular Las Vegas Algorithms for Polynomial Absolute Factorization Modular Las Vegas Algorithms for Polynomial Absolute Factorization

2009-11-26

arxiv.org/abs/0911.5024v2

Mathematics

Algebraic Geometry

Scientific paper

Let $f(X,Y) \in \ZZ[X,Y]$ be an irreducible polynomial over $\QQ$. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of $f$, or more precisely, of $f$ modulo some prime integer $p$. The same idea of choosing a $p$ satisfying some prescribed properties together with $LLL$ is used to provide a new strategy for absolute factorization of $f(X,Y)$. We present our approach in the bivariate case but the techniques extend to the multivariate case. Maple computations show that it is efficient and promising as we are able to factorize some polynomials of degree up to 400.

Affiliated with

Also associated with

No associations

Rating

Modular Las Vegas Algorithms for Polynomial Absolute Factorization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Modular Las Vegas Algorithms for Polynomial Absolute Factorization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modular Las Vegas Algorithms for Polynomial Absolute Factorization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-116314