Sciweavers

36 search results - page 1 / 8
» Factoring polynomials via polytopes
Sort
View
ISSAC
2004
Springer
106views Mathematics» more  ISSAC 2004»
14 years 4 months ago
Factoring polynomials via polytopes
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
Fatima Abu Salem, Shuhong Gao, Alan G. B. Lauder
JSC
2010
90views more  JSC 2010»
13 years 9 months ago
Modular Las Vegas algorithms for polynomial absolute factorization
Let f(X, Y ) ∈ Z[X, Y ] be an irreducible polynomial over Q. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of f, or more precisely,...
Cristina Bertone, Guillaume Chèze, Andr&eac...
DM
2011
191views Education» more  DM 2011»
13 years 5 months ago
Notes on lattice points of zonotopes and lattice-face polytopes
Minkowski’s second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowsk...
Christian Bey, Martin Henk, Matthias Henze, Eva Li...
AAECC
2010
Springer
136views Algorithms» more  AAECC 2010»
13 years 11 months ago
New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
Grégoire Lecerf
ISSAC
2004
Springer
88views Mathematics» more  ISSAC 2004»
14 years 4 months ago
Approximate factorization of multivariate polynomials via differential equations
Shuhong Gao, Erich Kaltofen, John May, Zhengfeng Y...