Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

31

JSC
2007

favoriteEmaildiscussreport

80views more JSC 2007»

Improved dense multivariate polynomial factorization algorithms

13 years 10 months ago

Improved dense multivariate polynomial factorization algorithms

Download www.math.uvsq.fr

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-quadratic time in the dense size of the input polynomial, and the probabilistic algorithm is softly optimal when the number of variables is at least three. We also investigate the reduction from several to two variables and improve the quantitative version of Bertini’s irreducibility theorem. Key words: Polynomial factorization, Hensel lifting, Bertini’s irreducibility theorem.

Grégoire Lecerf

Real-time Traffic

Bertini’s Irreducibility | JSC 2007 | Polynomial | Probabilistic Algorithm |

claim paper

Related Content

» FFTBased Dense Polynomial Arithmetic on Multicores

» Efficient Multivariate Factorization over Finite Fields

» Factoring polynomials via polytopes

» Approximate factorization of multivariate polynomials using singular value decomposition

» On factorization of multivariate polynomials over algebraic number and function fields

» A recombination algorithm for the decomposition of multivariate rational functions

» On the generation of multivariate polynomials which are hard to factor

» New recombination algorithms for bivariate polynomial factorization based on Hensel liftin...

» The DMM bound multivariate aggregate separation bounds

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2007
Where	JSC
Authors	Grégoire Lecerf

Comments (0)