Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields (Q2963217)
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: Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9967082142829896
0 references
0.8039811849594116
0 references
0.7917094826698303
0 references
0.7883308529853821
0 references
0.7783607244491577
0 references
