Pages that link to "Item:Q1095971"
From MaRDI portal
The following pages link to Factoring polynomials and primitive elements for special primes (Q1095971):
Displaying 19 items.
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- Factoring polynomials modulo special primes (Q909466) (← links)
- On the deterministic complexity of factoring polynomials over finite fields (Q911294) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Smoothness and factoring polynomials over finite fields (Q1178194) (← links)
- Computational problems in the theory of finite fields (Q1180998) (← links)
- Deterministic irreducibility testing of polynomials over large finite fields (Q1825030) (← links)
- Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290) (← links)
- Computing Frobenius maps and factoring polynomials (Q2366168) (← links)
- Trading GRH for algebra: Algorithms for factoring polynomials and related structures (Q3117221) (← links)
- Using partial smoothness of 𝑝-1 for factoring polynomials modulo 𝑝 (Q3160743) (← links)
- Searching for Primitive Roots in Finite Fields (Q3987942) (← links)
- On certain character sums over 𝔽_{𝕢}[𝕋] (Q4383041) (← links)
- Constructing nonresidues in finite fields and the extended Riemann hypothesis (Q4889937) (← links)
- (Q5089209) (← links)
- Deterministic polynomial factoring and association schemes (Q5170254) (← links)
- Factoring polynomials over special finite fields (Q5927536) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- On the deterministic complexity of factoring polynomials (Q5928878) (← links)
