On a New Factorization Algorithm for Polynomials Over Finite Fields
From MaRDI portal
Publication:4325734
DOI10.2307/2153339zbMath0822.11082OpenAlexW1984101529MaRDI QIDQ4325734
Harald Niederreiter, Rainer Göttfert
Publication date: 3 April 1995
Full work available at URL: https://doi.org/10.2307/2153339
complexitypolynomial timepolynomials over finite fieldsrational function fielddeterministic factorization algorithm
Related Items
Univariate polynomial factorization over finite fields, Ansätze for scattering amplitudes from \(p\)-adic numbers and algebraic geometry, Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields, Fast rectangular matrix multiplication and some applications, Factoring polynomials over finite fields: A survey, A note on the factorization method of Niederreiter
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the deterministic complexity of factoring polynomials over finite fields
- Connections between the algorithms of Berlekamp and Niederreiter for factoring polynomials over \(\mathbb{F}_ q\)
- Factorization of polynomials and some linear-algebra problems over finite fields
- Factorization of polynomials over finite fields and characteristic sequences
- Subspaces and polynomial factorizations over finite fields
- Computing Frobenius maps and factoring polynomials
- A new efficient factorization algorithm for polynomials over small finite fields
- Factoring Polynomials over Finite Fields Using Differential Equations and Normal Bases
- An Acceleration of the Niederreiter Factorization Algorithm in Characteristic 2
