\#P-completeness of counting roots of a sparse polynomial (Q1628696)

From MaRDI portal
scientific article
Language Label Description Also known as
English
\#P-completeness of counting roots of a sparse polynomial
scientific article

    Statements

    \#P-completeness of counting roots of a sparse polynomial (English)
    0 references
    0 references
    5 December 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    finite fields
    0 references
    \#P-completeness
    0 references
    0 references