\#P-completeness of counting roots of a sparse polynomial (Q1628696)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: \#P-completeness of counting roots of a sparse polynomial |
scientific article; zbMATH DE number 6989093
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \#P-completeness of counting roots of a sparse polynomial |
scientific article; zbMATH DE number 6989093 |
Statements
\#P-completeness of counting roots of a sparse polynomial (English)
0 references
5 December 2018
0 references
computational complexity
0 references
finite fields
0 references
\#P-completeness
0 references
0.7925959229469299
0 references
0.7587445378303528
0 references
0.7587445378303528
0 references
0.7423138618469238
0 references
0.7416135668754578
0 references
