Distinct Degree Factorizations for Polynomials over a Finite Field

DOI10.2307/2154936zbMath0834.11054OpenAlexW4245225834MaRDI QIDQ4846077

Arnold Knopfmacher, Richard Warlimont

Publication date: 21 August 1995

Full work available at URL: https://doi.org/10.2307/2154936

zbMATH Keywords

finite fieldpolynomialsirreducible factors

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)

Related Items (7)

Distinct degree factorizations in additive arithmetical semigroups ⋮ On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X\)] ⋮ Univariate polynomial factorization over finite fields ⋮ Enumeration of decomposable combinatorial structures with restricted patterns ⋮ Factoring polynomials over finite fields: A survey ⋮ Arithmetical semigroups related to trees and polyhedra ⋮ On the degrees of irreducible factors of polynomials over a finite field

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematics for the Analysis of Algorithms.
• On the deterministic complexity of factoring polynomials over finite fields
• Factoring polynomials using fewer random bits
• A New Algorithm for Factoring Polynomials Over Finite Fields

This page was built for publication: Distinct Degree Factorizations for Polynomials over a Finite Field