A lifting and recombination algorithm for rational factorization of sparse polynomials

Details A lifting and recombination algorithm for rational factorization of sparse polynomials A lifting and recombination algorithm for rational factorization of sparse polynomials

2009-12-04

arxiv.org/abs/0912.0895v1

Mathematics

Algebraic Geometry

22 pages

Scientific paper

We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm of Lecerf, with now a polynomial complexity in the volume of the Newton polytope. We adopt a geometrical point of view, the main tool being derived from some algebraic osculation criterions in toric varieties.

Affiliated with

Also associated with

No associations

Rating

A lifting and recombination algorithm for rational factorization of sparse polynomials 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 A lifting and recombination algorithm for rational factorization of sparse polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A lifting and recombination algorithm for rational factorization of sparse polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-420997