A lifting and recombination algorithm for rational factorization of sparse polynomials - Mathematics > Algebraic GeometryReport as inadecuate




A lifting and recombination algorithm for rational factorization of sparse polynomials - Mathematics > Algebraic Geometry - Download this document for free, or read online. Document in PDF available to download.

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



Author: Martin Weimann

Source: https://arxiv.org/







Related documents