Randomized NP-completeness for <i>p</i> -adic rational roots of sparse polynomials in one variable (Q2946560)
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: Randomized NP-completeness for p -adic rational roots of sparse polynomials in one variable |
scientific article; zbMATH DE number 6483070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Randomized NP-completeness for <i>p</i> -adic rational roots of sparse polynomials in one variable |
scientific article; zbMATH DE number 6483070 |
Statements
Randomized NP-completeness for <i>p</i> -adic rational roots of sparse polynomials in one variable (English)
0 references
17 September 2015
0 references
\(p\)-adic
0 references
NP
0 references
arithmetic progression
0 references
feasibility
0 references
sparse
0 references
0 references
0.8971517
0 references
0.88105655
0 references
0.8777624
0 references
0.87634355
0 references
0.8759409
0 references
0 references
0.87375814
0 references
0.86606306
0 references
0.8659624
0 references
