On solving univariate sparse polynomials in logarithmic time (Q1763426): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jco.2004.03.004 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCO.2004.03.004 / rank | |||
Normal rank | |||
Latest revision as of 09:24, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On solving univariate sparse polynomials in logarithmic time |
scientific article |
Statements
On solving univariate sparse polynomials in logarithmic time (English)
0 references
22 February 2005
0 references
Sparse polynomial
0 references
Lacunary polynomial
0 references
Computational real algebraic geometry
0 references
Fewnomial
0 references
Speed up
0 references
Trinomial
0 references
Newton's method
0 references
Smale's 17th Problem
0 references
Real root counting
0 references
m-nomial
0 references
Alpha theory
0 references
Discriminant
0 references
Logarithmic
0 references
Complexity
0 references
Approximate root
0 references
0 references
0 references
