Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ISSAC
2004
Springer

favoriteEmaildiscussreport

106views Mathematics» more ISSAC 2004»

Factoring polynomials via polytopes

13 years 10 months ago

Factoring polynomials via polytopes

Download www.cs.aub.edu.lb

We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to present an algorithm for factoring bivariate polynomials which is able to exploit to some extent the sparsity of polynomials. We give details of an implementation which we used to factor randomly chosen sparse and composite polynomials of high degree over the binary ﬁeld. Categories and Subject Descriptors

Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder

Real-time Traffic

Bivariate Polynomials | Composite Polynomials | ISSAC 2004 | Multivariate Polynomial Factorisation |

claim paper

Related Content

» Modular Las Vegas algorithms for polynomial absolute factorization

» Notes on lattice points of zonotopes and latticeface polytopes

» New recombination algorithms for bivariate polynomial factorization based on Hensel liftin...

» Approximate factorization of multivariate polynomials via differential equations

» Approximating the Nonhomogeneous Lognormal Diffusion Process via Polynomial Exogenous Fact...

» On the hardness of minkowski addition and related operations

» On the complexity of factoring bivariate supersparse Lacunary polynomials

» Absolute polynomial factorization in two variables and the knapsack problem

» Rationality and Strongly Polynomial Solvability of EisenbergGale Markets with Two Agents

Post Info
More Details (n/a)

Added	02 Jul 2010
Updated	02 Jul 2010
Type	Conference
Year	2004
Where	ISSAC
Authors	Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder

Comments (0)