Pages that link to "Item:Q1210556"
From MaRDI portal
The following pages link to Counting irreducible factors of polynomials over a finite field (Q1210556):
Displaying 11 items.
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- On the degrees of irreducible factors of polynomials over a finite field (Q1297409) (← links)
- On the largest degree of an irreducible factor of a polynomial in \(\mathbb{F}_q[X]\) (Q1382695) (← links)
- Computing discrete logarithms in cryptographically-interesting characteristic-three finite fields (Q1620973) (← links)
- Enumerating \(D_4\) quartics and a Galois group bias over function fields (Q2086410) (← links)
- On the enumeration of polynomials with prescribed factorization pattern (Q2135566) (← links)
- Analysis of Rabin's irreducibility test for polynomials over finite fields (Q2772930) (← links)
- Polynomial factorization over ${\mathbb F}_2$ (Q3147181) (← links)
- Some results on counting roots of polynomials and the Sylvester resultant (Q5111015) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- On the number of irreducible factors with a given multiplicity in function fields (Q6063239) (← links)
