Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (Q2000290)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes
scientific article

    Statements

    Deterministic polynomial factoring over finite fields: a uniform approach via \(\mathcal{P}\)-schemes (English)
    0 references
    0 references
    28 June 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial factoring
    0 references
    permutation group
    0 references
    finite field
    0 references
    algebraic combinatorics
    0 references
    deterministic polynomial-time factoring algorithm
    0 references
    primitive Galois groups of superpolynomial order
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references