A near-optimal algorithm for computing real roots of sparse polynomials (Q3452416): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:12, 4 February 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
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
