Random polynomials and expected complexity of bisection methods for real solving
Work
Year: 2010
Type: article
Abstract: Our probabilistic analysis sheds light to the following questions: Why do random polynomials seem to have few, and well separated real roots, on the average? Why do exact algorithms for real root isol... more
Cites: 40
Cited by: 23
Related to: 10
FWCI: 4.365
Citation percentile (by year/subfield): 91.23
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Sustainable Development Goal Reduced inequalities
Open Access status: green
Funder Seventh Framework Programme
Grant ID PITN-GA-2008-214584