A Deterministic Algorithm for Factorizing Polynomials of Fq [X]
From MaRDI portal
Publication:3672093
DOI10.1016/S0304-0208(08)73382-6zbMath0522.12019MaRDI QIDQ3672093
Publication date: 1983
Published in: Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)
idempotentfactorization of polynomials over finite fieldsdeterministic algorithmfinite dimensional semi-simple commutative algebra
Polynomials over finite fields (11T06) Commutative Artinian rings and modules, finite-dimensional algebras (13E10) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items
A new efficient factorization algorithm for polynomials over small finite fields ⋮ Factoring of \(x^ n -1\) and orthogonalization over finite fields of characteristic 2 ⋮ Deterministic root finding over finite fields using Graeffe transforms ⋮ Factoring polynomials and primitive elements for special primes ⋮ Computing the structure of finite algebras ⋮ A generalisation of the Cantor-Zassenhaus algorithm ⋮ Univariate polynomial factorization over finite fields ⋮ On splitting sets in block designs and finding roots of polynomials ⋮ Factoring polynomials over finite fields: A survey ⋮ On the deterministic complexity of factoring polynomials ⋮ Deterministic irreducibility testing of polynomials over large finite fields ⋮ Trading GRH for algebra: Algorithms for factoring polynomials and related structures
