A Deterministic Algorithm for Factorizing Polynomials of Fq [X]

DOI10.1016/S0304-0208(08)73382-6MaRDI QIDQ3672093zbMATHFDO

Authors Paul Camion

Publication date 1983

Published in Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

idempotentdeterministic algorithmfactorization of polynomials over finite fieldsfinite dimensional semi-simple commutative algebra

Mathematics Subject Classification ID

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)

Cited in

(12)

• Factoring polynomials and primitive elements for special primes
• Computing the structure of finite algebras
• On splitting sets in block designs and finding roots of polynomials
• A generalisation of the Cantor-Zassenhaus algorithm
• Deterministic root finding over finite fields using Graeffe transforms
• Trading GRH for algebra: algorithms for factoring polynomials and related structures
• Deterministic irreducibility testing of polynomials over large finite fields
• Factoring of \(x^ n -1\) and orthogonalization over finite fields of characteristic 2
• A new efficient factorization algorithm for polynomials over small finite fields
• Univariate polynomial factorization over finite fields
• Factoring polynomials over finite fields: A survey
• On the deterministic complexity of factoring polynomials

This page was built for publication: A Deterministic Algorithm for Factorizing Polynomials of Fq [X]

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3672093)