On the degrees of irreducible factors of polynomials over a finite field

DOI10.1016/S0012-365X(98)00174-5zbMath0931.11055MaRDI QIDQ1297409

Arnold Knopfmacher

Publication date: 10 November 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

irreducible polynomialspolynomials over a finite field

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gaussian limiting distributions for the number of components in combinatorial structures
• On the deterministic complexity of factoring polynomials over finite fields
• Factoring polynomials using fewer random bits
• Three problems in combinatorial asymptotics
• Counting irreducible factors of polynomials over a finite field
• Computing Frobenius maps and factoring polynomials
• Singularity Analysis of Generating Functions
• A New Algorithm for Factoring Polynomials Over Finite Fields
• Distinct Degree Factorizations for Polynomials over a Finite Field

This page was built for publication: On the degrees of irreducible factors of polynomials over a finite field