Subgroup Refinement Algorithms for Root Finding in $GF(q)$ (Q3990651)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Subgroup Refinement Algorithms for Root Finding in $GF(q)$
scientific article

    Statements

    Subgroup Refinement Algorithms for Root Finding in $GF(q)$ (English)
    0 references
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references