稀疏多项式有理因式分解的提升重组算法
A lifting and recombination algorithm for rational factorization of sparse polynomials
摘要：
我们提出了一个新的提升和重组计划的合理二元多项式因式分解，利用牛顿多面体几何。我们得到一个确定性的算法，可以被看作是一个稀疏版本的算法的Lecerf，现在一个多项式的复杂性的体积的牛顿多面体。我们采用几何的观点，主要工具是来自一些代数密切准则复曲面品种。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
