Subgroup Refinement Algorithms for Root Finding in $GF(q)$ (Q3990651)
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: Subgroup Refinement Algorithms for Root Finding in $GF(q)$ |
scientific article; zbMATH DE number 38444
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subgroup Refinement Algorithms for Root Finding in $GF(q)$ |
scientific article; zbMATH DE number 38444 |
Statements
Subgroup Refinement Algorithms for Root Finding in $GF(q)$ (English)
0 references
28 June 1992
0 references
polynomial factorization
0 references
finite fields
0 references
root finding algorithm
0 references
polynomial time
0 references
deterministic algorithm
0 references