A lifting and recombination algorithm for rational factorization of sparse polynomials
Algebraic Geometry
2009-12-07 v1
Abstract
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.
Cite
@article{arxiv.0912.0895,
title = {A lifting and recombination algorithm for rational factorization of sparse polynomials},
author = {Martin Weimann},
journal= {arXiv preprint arXiv:0912.0895},
year = {2009}
}
Comments
22 pages