Almost tight recursion tree bounds for the Descartes method (Q2958973): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Q164227 / rank | |||
| Property / author | |||
| Property / author: Chee-Keng Yap / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1145768.1145786 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2158622794 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:07, 19 March 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
