Provider: JSTOR http://www.jstor.org
Database: JSTOR
Content: text/plain; charset="us-ascii"
TY - JOUR
TI - REDUCTION OF BIVARIATE POLYNOMIALS FROM CONVEX-DENSE TO DENSE, WITH APPLICATION TO FACTORIZATIONS
AU - BERTHOMIEU, JÉRÉMY
AU - LECERF, GRÉGOIRE
AB - In this article we present a new algorithm for reducing the usual sparse bivariate factorization problems to the dense case. This reduction simply consists of computing an invertible monomial transformation that produces a polynomial with a dense size of the same order of magnitude as the size of the integral convex hull of the support of the input polynomial. This approach turns out to be very efficient in practice, as demonstrated with our implementation.
C1 - Full publication date: JULY 2012
EP - 1821
IS - 279
JO - Mathematics of Computation
PB - American Mathematical Society
PY - 2012
SN - 00255718, 10886842
SP - 1799
UR - http://www.jstor.org/stable/23268066
VL - 81
Y2 - 2021/03/01/
ER -