Gcd of multivariate polynomials via Newton polytopes

作者:

Highlights:

摘要

We study geometric criteria to determine coprimality between multivariate polynomials. Our main contribution is the development of a polynomial-time algorithm (on the number of monomials) that detects coprimality of multivariate polynomials using Newton polytopes. We also show how to construct the gcd of two bivariate polynomials using their Newton polygons.

论文关键词:Newton polytope,Multivariate polynomial,Greatest common divisor

论文评审过程:Available online 24 March 2011.

论文官网地址:https://doi.org/10.1016/j.amc.2011.03.035