Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (Q2894535)

In this article the authors present a new algorithm for reducing the usual sparse bivariate factorization problems to the dense case. This reduction 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 the authors demonstrate with their implementation.