Sciweavers

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

11

STOC
1995
ACM

favoriteEmaildiscussreport

135views Algorithms» more STOC 1995»

Subquadratic-time factoring of polynomials over finite fields

13 years 8 months ago

Subquadratic-time factoring of polynomials over finite fields

Download www4.ncsu.edu

New probabilistic algorithms are presented for factoring univariate polynomials over ﬁnite ﬁelds. The algorithms factor a polynomial of

Erich Kaltofen, Victor Shoup

Real-time Traffic

Algorithms | STOC 1995 | Univariate Polynomials |

claim paper

Related Content

» Parity of the number of irreducible factors for composite polynomials

» Factoring Polynomials over Finite Fields using Balance Test

» Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields

» Factoring in SkewPolynomial Rings over Finite Fields

» Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wie...

» Efficient Multivariate Factorization over Finite Fields

» Parallel sparse polynomial interpolation over finite fields

» Relatively prime polynomials and nonsingular Hankel matrices over finite fields

» On Exponential Sums Nowton identities and Dickson Polynomials over Finite Fields

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	STOC
Authors	Erich Kaltofen, Victor Shoup

Comments (0)