135 search results - page 2 / 27 » Improved dense multivariate polynomial factorization algorit... |
ISSAC
2009
Springer
15 years 4 months ago
2009
Springer
We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...
106
click to vote
CORR
2010
Springer
14 years 4 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...
82
Voted
STOC
1993
ACM
15 years 1 months ago
1993
ACM
In this paper we consider the di culty of factoring multivariate polynomials F(x y z :::) modulo n. We consider in particular the case in which F is a product of two randomly chose...
AAECC
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...