On solving univariate sparse polynomials in logarithmic time (Q1763426)

From MaRDI portal
Revision as of 07:20, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    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

    Identifiers