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)\).




Cited in
(25)








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)