On solving univariate sparse polynomials in logarithmic time
Under an Elsevier user license
open archive
Keywords
Sparse polynomial
Lacunary polynomial
Computational real algebraic geometry
Fewnomial
Speed up
Trinomial
Newton's method
Smale's 17th Problem
Real root counting
m-nomial
Alpha theory
Discriminant
Logarithmic
Complexity
Approximate root
Cited by (0)
- 1
Partially funded by Hong Kong/France PROCORE Grant #9050140-730, a Texas A&M University Faculty of Science Grant, and NSF Grants DMS-0138446 and DMS-0211458.
- 2
Partially funded by NSF Grant DMS-9703490 and the City University of Hong Kong. The second author's work was done while visiting the Department of Mathematics at the City University of Hong Kong.
Copyright © 2004 Elsevier Inc. All rights reserved.