Sciweavers

Share
12 search results - page 1 / 3
» Fast Polynomial Factorization Over High Algebraic Extensions...
Sort
View
ISSAC
1997
Springer
138views Mathematics» more  ISSAC 1997»
8 years 10 months ago
Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields
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 ...
Erich Kaltofen, Victor Shoup
CORR
2008
Springer
129views Education» more  CORR 2008»
8 years 6 months ago
Factoring Polynomials over Finite Fields using Balance Test
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 ...
Chandan Saha
ISSAC
2009
Springer
269views Mathematics» more  ISSAC 2009»
9 years 1 months ago
On factorization of multivariate polynomials over algebraic number and function fields
We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
CORR
2008
Springer
125views Education» more  CORR 2008»
8 years 6 months ago
Simultaneous Modular Reduction and Kronecker Substitution for Small Finite Fields
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy
CORR
2008
Springer
132views Education» more  CORR 2008»
8 years 6 months ago
Trading GRH for algebra: algorithms for factoring polynomials and related structures
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
Gábor Ivanyos, Marek Karpinski, Lajos R&oac...
books