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.
This journal, begun in 1943 as Mathematical Tables and Other Aids to Computation, publishes original articles on all aspects of numerical mathematics, book reviews, mathematical tables, and technical notes. It is devoted to advances in numerical analysis, the application of computational methods, high speed calculating, and other aids to computation.
Founded in 1888, to further mathematical research and scholarship, the 30,000-member American Mathematical Society provides programs and services that promote mathematical research and its uses, strengthen mathematical education, and foster awareness and appreciation of mathematics and its connections to other disciplines and everyday life. The headquarters of the AMS are in Providence, Rhode Island. The Society also maintains a government relations office in Washington, D.C., the Mathematical Reviews editorial office in Ann Arbor, Michigan, and a warehouse and distribution facility in Pawtucket, Rhode Island. The Society has approximately 240 employees.
This item is part of a JSTOR Collection.
For terms and use, please refer to our Terms and Conditions
Mathematics of Computation
© 2012 American Mathematical Society
Request Permissions
