Constructing irreducible polynomials over finite fields

DOI10.1090/S0025-5718-2011-02567-6zbMath1277.11111OpenAlexW2167203677MaRDI 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

zbMATH Keywords

finite fieldsHilbert class polynomials

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

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

This page was built for publication: Constructing irreducible polynomials over finite fields