Sciweavers

135 search results - page 1 / 27
» Improved dense multivariate polynomial factorization algorit...
Sort
View
JSC
2007
80views more  JSC 2007»
13 years 10 months ago
Improved dense multivariate polynomial factorization algorithms
We present new deterministic and probabilistic algorithms that reduce the factorization of dense polynomials from several to one variable. The deterministic algorithm runs in sub-...
Grégoire Lecerf
HPCS
2009
IEEE
14 years 2 months ago
FFT-Based Dense Polynomial Arithmetic on Multi-cores
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
Marc Moreno Maza, Yuzhen Xie
AAECC
1997
Springer
115views Algorithms» more  AAECC 1997»
14 years 3 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 det...
Laurent Bernardin, Michael B. Monagan
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
2008
162views more  JSC 2008»
13 years 11 months ago
Approximate factorization of multivariate polynomials using singular value decomposition
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
Erich Kaltofen, John P. May, Zhengfeng Yang, Lihon...