Constructing irreducible polynomials over finite fields
From MaRDI portal
Publication:2894527
DOI10.1090/S0025-5718-2011-02567-6zbMath1277.11111MaRDI QIDQ2894527
Enver Ozdemir, San Ling, Xing, Chaoping
Publication date: 29 June 2012
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2011-02567-6
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of class polynomial computation via floating point approximations
- A Rigorous Subexponential Algorithm For Computation of Class Groups
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- Probabilistic Algorithms in Finite Fields
- Subquadratic-time factoring of polynomials over finite fields
- Class numbers of imaginary quadratic fields
- Abelian varieties over finite fields