On the deterministic complexity of factoring polynomials over finite fields (Q911294)

From MaRDI portal
Revision as of 01:10, 7 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the deterministic complexity of factoring polynomials over finite fields
scientific article

    Statements

    On the deterministic complexity of factoring polynomials over finite fields (English)
    0 references
    0 references
    1990
    0 references
    factorization
    0 references
    irreducible polynomials
    0 references

    Identifiers