Pages that link to "Item:Q3672093"
From MaRDI portal
The following pages link to A Deterministic Algorithm for Factorizing Polynomials of Fq [X] (Q3672093):
Displaying 12 items.
- Deterministic root finding over finite fields using Graeffe transforms (Q300881) (← links)
- On splitting sets in block designs and finding roots of polynomials (Q915734) (← links)
- Factoring polynomials and primitive elements for special primes (Q1095971) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Factoring of \(x^ n -1\) and orthogonalization over finite fields of characteristic 2 (Q1340509) (← links)
- A generalisation of the Cantor-Zassenhaus algorithm (Q1377270) (← links)
- Deterministic irreducibility testing of polynomials over large finite fields (Q1825030) (← links)
- A new efficient factorization algorithm for polynomials over small finite fields (Q2366271) (← links)
- Computing the structure of finite algebras (Q2640676) (← links)
- Trading GRH for algebra: Algorithms for factoring polynomials and related structures (Q3117221) (← links)
- Factoring polynomials over finite fields: A survey (Q5928877) (← links)
- On the deterministic complexity of factoring polynomials (Q5928878) (← links)
