Constructing irreducible polynomials over finite fields
type: Item
instance of: scholarly article
title: Constructing irreducible polynomials over finite fields
zbMATH Open document ID: 1277.11111
DOI: 10.1090/S0025-5718-2011-02567-6
author: San Ling
author: Enver Ozdemir
author: Chaoping Xing
published in: Mathematics of Computation
publication date: 2012-06-29T00:00:00Z
Mathematics Subject Classification ID: 11T06
Mathematics Subject Classification ID: 11Y16
zbMATH DE Number: 6051354
zbMATH Keywords: finite fields
zbMATH Keywords: Hilbert class polynomials
MaRDI profile type: Publication
cites work: Q3139838
cites work: The complexity of class polynomial computation via floating point approximations
cites work: A Rigorous Subexponential Algorithm For Computation of Class Groups
cites work: Subquadratic-time factoring of polynomials over finite fields
cites work: Probabilistic Algorithms in Finite Fields
cites work: New Algorithms for Finding Irreducible Polynomials Over Finite Fields
cites work: Q5386130
cites work: Abelian varieties over finite fields
cites work: Class numbers of imaginary quadratic fields
full work available at URL: s0025-5718-2011-02567-6
OpenAlex ID: W2167203677
Recommended article: Construction of Irreducible Polynomials over Finite Fields
Recommended article: Construction of irreducible polynomials over finite fields
Recommended article: Q3676235
Recommended article: The explicit construction of irreducible polynomials over finite fields
Recommended article: Q3480171
Recommended article: Recursive constructions of irreducible polynomials over finite fields
Recommended article: Q4724729
Recommended article: Irreducible polynomials over a finite field
Recommended article: Q3476921
Recommended article: Constructions of irreducible polynomials over finite fields with even characteristic
description: scientific article; zbMATH DE number 6051354