Sciweavers

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

13

AAECC
2010
Springer

favoriteEmaildiscussreport

136views Algorithms» more AAECC 2010»

New recombination algorithms for bivariate polynomial factorization based on Hensel lifting

13 years 4 months ago

New recombination algorithms for bivariate polynomial factorization based on Hensel lifting

Download www.math.uvsq.fr

Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel lifting technique. For the dense bi-degree polynomial representation, the costs of our recombination algorithms are essentially sub-quadratic.

Grégoire Lecerf

Real-time Traffic

AAECC 2010 | Algorithms | Bi-degree Polynomial Representation | Bivariate Polynomial | Hensel Lifting Technique |

claim paper

Related Content

» Complexity issues in bivariate polynomial factorization

» Hensel lifting and bivariate polynomial factorisation over finite fields

» Factoring polynomials via polytopes

» Improved dense multivariate polynomial factorization algorithms

» A Numerical Absolute Primality Test for Bivariate Polynomials

» Finding Small Roots of Bivariate Integer Polynomial Equations A Direct Approach

» Finding Small Roots of Bivariate Integer Polynomial Equations Revisited

» Modular Las Vegas algorithms for polynomial absolute factorization

» A Theory of Coprime Blurred Pairs

Post Info
More Details (n/a)

Added	08 Dec 2010
Updated	08 Dec 2010
Type	Journal
Year	2010
Where	AAECC
Authors	Grégoire Lecerf

Comments (0)