425 search results - page 3 / 85 » Polynomial Factorization 1987-1991 |
CORR
2008
Springer
13 years 7 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
2007
Springer
14 years 1 months ago
2007
Springer
We briefly present and analyze, from a geometric viewpoint, strategies for designing algorithms to factor bivariate approximate polynomials in [x, y]. Given a composite polyno...
JC
2007
13 years 7 months ago
2007
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
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...
FFA
2010
13 years 4 months ago
2010
Various results on parity of the number of irreducible factors of given polynomials over finite fields have been obtained in the recent literature. Those are mainly based on Swan&...