scientific article; zbMATH DE number 3997938
From MaRDI portal
Publication:4724729
[For the entire collection see Zbl 0597.00033.] This paper is an abstract of a lecture on algorithms for computing irreducible polynomials of degree \(d>n\) in \({\mathbb{F}}[x]\) where \({\mathbb{F}}=GF(p^ e)\). The running time depends on several conjectures such as Artin's conjecture and the extended Riemann hypothesis. A typical result is that if certain conjectures are true, then (ne log p)\({}^{O(1)}\) bit operations are necessary and \(d=O(n \log^ 2p)\).
Recommendations
Cited in
(25)- Factoring polynomials and primitive elements for special primes
- Computational problems in the theory of finite fields
- Finding irreducible and primitive polynomials
- Irreducible polynomials over finite fields. I
- Irreducibility criteria for polynomials over some imaginary quadratic fields
- Irreducible polynomials over finite fields with prescribed trace/prescribed constant term
- A note on the construction of finite Galois fields \(\mathrm{GF}(p^n)\)
- Irreducibility and multiplicative composition of polynomials over finite fields
- Constructing irreducible polynomials over finite fields
- GALOIS IRREDUCIBLE POLYNOMIALS
- Multiplicative groups of fields and hereditarily irreducible polynomials
- Counting irreducible polynomials over finite fields
- scientific article; zbMATH DE number 4152523 (Why is no real title available?)
- New Algorithms for Finding Irreducible Polynomials Over Finite Fields
- scientific article; zbMATH DE number 4027619 (Why is no real title available?)
- Irreducibility of the iterates of a quadratic polynomial over a field
- IRREDUCIBILITY OF GALOIS POLYNOMIALS
- scientific article; zbMATH DE number 6963661 (Why is no real title available?)
- Polynomials, constructivity and randomness
- GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS
- Irreducibility and deterministic \(r\)-th root finding over finite fields
- Irreducibility of Hurwitz polynomials over the ring of integers
- Classification of irreducible factorable polynomials over a finite field
- Irreducible skew polynomials over domains
- A correspondence of certain irreducible polynomials over finite fields
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4724729)