Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (Q2816831)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields
scientific article

    Statements

    Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields (English)
    0 references
    0 references
    0 references
    0 references
    26 August 2016
    0 references
    solvability
    0 references
    sparse polynomial
    0 references
    finite fields
    0 references
    NP-hardness
    0 references
    gcd
    0 references
    square-free
    0 references
    discriminant
    0 references
    resultant
    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

    Identifiers

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