A near-optimal algorithm for computing real roots of sparse polynomials (Q3452416): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059357470 / rank
 
Normal rank

Revision as of 19:14, 19 March 2024

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