No label defined (Q4724729)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3997938
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3997938 |
Statements
1986
0 references
finite fields
0 references
deterministic algorithm
0 references
irreducible polynomials
0 references
0.860921323299408
0 references
0.8594582676887512
0 references
0.8571817874908447
0 references
[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)\).
0 references