Almost tight recursion tree bounds for the Descartes method (Q2958973): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:17, 3 February 2024
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
3 February 2017
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
