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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

The fundamental theorem of algebra states that every non-constant polynomial with complex coefficients can be factorized on…

2011

We consider the deterministic complexity of the problem of polynomial factorization over finite fields given a finite field Fq…

Review

1998

Review

1998

1995

Recently Niederreiter described a new method for factoring polynomials over finite fields. As with the Berlekamp technique, the…

1993

Abstract A new factorization algorithm for polynomials over finite fields was recently developed by the first author. For finite…

1991

Highly Cited

1990

Highly Cited

1990

1984

Based on Kummer Theorem, we study the deterministic complexity of two factorization problems: polynomial factorization over…

1981

Let f(x) be a polynomial over a finite field F. An algorithm for determining the degrees of the factors of f(x) is presented. As…

1981

This paper considers the problem of factoring polynomials over a variety of domains. We first describe the current methods of…