Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (Q2894535)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations |
scientific article; zbMATH DE number 6051361
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations |
scientific article; zbMATH DE number 6051361 |
Statements
Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations (English)
0 references
29 June 2012
0 references
polynomial factorization
0 references
bivariate polynomials
0 references
squarefree factorization
0 references
irreducible factorization
0 references
0 references
0 references
0 references
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.
0 references
