On the Boolean complexity of real root refinement (Q2963249)
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: On the Boolean complexity of real root refinement |
scientific article; zbMATH DE number 6683867
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Boolean complexity of real root refinement |
scientific article; zbMATH DE number 6683867 |
Statements
On the boolean complexity of real root refinement (English)
0 references
10 February 2017
0 references
Boolean complexity
0 references
polynomial
0 references
real root problem
0 references
real root refinement
0 references
0.9263953566551208
0 references
0.8094919323921204
0 references
0.8050159215927124
0 references
0.796607494354248
0 references
0.7962737679481506
0 references
