Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields (Q2910410)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields |
scientific article; zbMATH DE number 6080708
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields |
scientific article; zbMATH DE number 6080708 |
Statements
11 September 2012
0 references
complexity
0 references
irreducible polynomial
0 references
normal polynomial
0 references
Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields (English)
0 references
