Random polynomials and expected complexity of bisection methods for real solving (Q2946544)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Random polynomials and expected complexity of bisection methods for real solving |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Random polynomials and expected complexity of bisection methods for real solving |
scientific article |
Statements
Random polynomials and expected complexity of bisection methods for real solving (English)
0 references
17 September 2015
0 references
Bernstein polynomial
0 references
expected complexity
0 references
random polynomial
0 references
real-root isolation
0 references
separation bound
0 references
0 references
0.8972927
0 references
0.8918801
0 references
0.88545144
0 references
0.8802641
0 references
0.87901354
0 references
0.8769342
0 references
0.8760947
0 references
