FAQ

Factorization of polynomials over finite fields

Known as: Factoring polynomials over finite fields, Polynomial factorization over finite fields, Distinct degree factorization 
In mathematics and computer algebra the factorization of a polynomial consists of decomposing it into a product of irreducible factors. This… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2015
012319842015

Related topics

Related topics

24 relations
AlgorithmBCH codeBerlekamp's algorithmCantor–Zassenhaus algorithm
(More)

Broader (1)

Computational number theory

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Factorization of polynomials over finite fields
Algorithm
Coefficient
Polynomial
Time complexity
Randomized algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Polynomial Factorization over Finite Fields By Computing Euler-Poincare Characteristics of Drinfeld Modules
We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank 2… (More)
Is this relevant?
2013
2013
Random Polynomials over Finite Fields: Statistics and Algorithms
Polynomials appear in many research articles of Philippe Flajolet. Here we concentrate only in papers where polynomials play a… (More)
Is this relevant?
2010
2010
On Polynomial Factorization Over Finite Fields
Let fix) be a polynomial over a finite field F. An algorithm for determining the degrees of the factors of fix) is presented. As… (More)
Is this relevant?
2004
2004
Deterministic distinct-degree factorization of polynomials over finite fields
A deterministic polynomial time algorithm is presented for finding the distinctdegree factorization of multivariate polynomials… (More)
Is this relevant?
2004
2004
Addendum to "Factoring polynomials over finite fields with Drinfeld modules"
After my paper [2] was electronically published by Mathematics of Computation, I came across the PhD thesis of professor I. Y… (More)
Is this relevant?
Review
2002
Review
2002
Yet another practical implementation of polynomial factorization over finite fields
Polynomial factorization plays a significant role in computational mathematics and its application to engineering, since it forms… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Factorization of Polynomials over Finite Fields and Characteristic Sequences
 
Is this relevant?
1991
1991
Factorization of Polynomials over Finite Fields and Decomposition of Primes in Algebraic Number Fields
It is shown that factoring polynomials over finite prime fields is polynomial-time equivalent to decomposing primes in algebraic… (More)
Is this relevant?
1987
1987
Factoring polynomials over finite fields
We propose a new deterministic method of factoring polynomials over finite fields. Assuming the Generalized Riemann Hypothesis… (More)
Is this relevant?
1984
1984
Factorization of Polynomials over Finite Fields and Factorization of Primes in Algebraic Number Fields
Based on Kummer Theorem, we study the deterministic complexity of two factorization problems: polynomial factorization over… (More)
Is this relevant?