A near-optimal algorithm for computing real roots of sparse polynomials (Q3452416)

From MaRDI portal
Revision as of 10:04, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A near-optimal algorithm for computing real roots of sparse polynomials
scientific article

    Statements

    A near-optimal algorithm for computing real roots of sparse polynomials (English)
    0 references
    0 references
    11 November 2015
    0 references
    arithmetic complexity
    0 references
    bit complexity
    0 references
    numerical algorithms
    0 references
    root isolation
    0 references
    root refinement
    0 references
    sparse polynomials
    0 references

    Identifiers