54 search results - page 1 / 11 » Factoring Polynomials over Local Fields II |
ANTS
2010
Springer
13 years 8 months ago
2010
Springer
STOC
1995
ACM
13 years 8 months ago
1995
ACM
New probabilistic algorithms are presented for factoring univariate polynomials over finite fields. The algorithms factor a polynomial of
FFA
2006
13 years 4 months ago
2006
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formul...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
ISSAC
1997
Springer
13 years 8 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...