Almost tight recursion tree bounds for the Descartes method (Q2958973)

From MaRDI portal
Revision as of 12:01, 24 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Almost tight recursion tree bounds for the Descartes method
scientific article

    Statements

    Almost tight recursion tree bounds for the Descartes method (English)
    0 references
    0 references
    0 references
    0 references
    3 February 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    Bernstein basis
    0 references
    Davenport-Mahler bound
    0 references
    Descartes method
    0 references
    Descartes rule of signs
    0 references
    polynomial real root isolation
    0 references