Factoring polynomials over finite fields

DOI10.1016/0196-6774(88)90029-6zbMath0651.12013OpenAlexW1997080184MaRDI QIDQ3795755

Lajos Rónyai

Publication date: 1988

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(88)90029-6

zbMATH Keywords

algorithmpolynomial timefactorization of a polynomial over an arbitrary finite field

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Software, source code, etc. for problems pertaining to field theory (12-04)

Related Items (13)

Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 ⋮ Finite nonassociative algebras obtained from skew polynomials and possible applications to \((f,\sigma,\delta)\)-codes ⋮ An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function ⋮ Constructing nonresidues in finite fields and the extended Riemann hypothesis ⋮ HOW A NONASSOCIATIVE ALGEBRA REFLECTS THE PROPERTIES OF A SKEW POLYNOMIAL ⋮ Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes ⋮ Factoring polynomials over finite fields: A survey ⋮ On the deterministic complexity of factoring polynomials ⋮ Searching for Primitive Roots in Finite Fields ⋮ Deterministic polynomial factoring and association schemes ⋮ Unnamed Item ⋮ Explicit Bounds for Primality Testing and Related Problems ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures

This page was built for publication: Factoring polynomials over finite fields