Sciweavers

Share
AAECC
1997
Springer

Efficient Multivariate Factorization over Finite Fields

10 years 8 months ago
Efficient Multivariate Factorization over Finite Fields
We describe the Maple [23] implementation of multivariate factorization over general finite fields. Our first implementation is available in Maple V Release 3. We give selected details of the algorithms and show several ideas that were used to improve its efficiency. Most of the improvements presented here are incorporated in Maple V Release 4. In particular, we show that we needed a general tool for implementing computations in GF(pk)[xl, x2,..., x,,]. We also needed an efficient implementation of our algorithms in Zp[y][x] because any multivariate factorization may depend on several bivariate factorizations. The efficiency of our implementation is illustrated by the ability to factor bivariate polynomials with over a million monomials over a small prime field.
Laurent Bernardin, Michael B. Monagan
Added 07 Aug 2010
Updated 07 Aug 2010
Type Conference
Year 1997
Where AAECC
Authors Laurent Bernardin, Michael B. Monagan
Comments (0)
books