Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields (Q2963217)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields |
scientific article |
Statements
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields (English)
0 references
10 February 2017
0 references
NP-hardness
0 references
discriminant
0 references
finite fields
0 references
gcd
0 references
resultant
0 references
solvability
0 references
sparse polynomial
0 references
square-free
0 references
