4 search results - page 1 / 1 » Factoring bivariate sparse (lacunary) polynomials |
JC
2007
13 years 10 months ago
2007
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their...
ISSAC
2005
Springer
14 years 4 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
ISSAC
2004
Springer
14 years 4 months ago
2004
Springer
We introduce a new approach to multivariate polynomial factorisation which incorporates ideas from polyhedral geometry, and generalises Hensel lifting. Our main contribution is to...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...