Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6861207 | Journal of Symbolic Computation | 2018 | 4 Pages |
Abstract
We show that a linear-time algorithm for computing Hong's bound for positive roots of a univariate polynomial, described by K. Mehlhorn and S. Ray in an article “Faster algorithms for computing Hong's bound on absolute positiveness”, is incorrect. We present a corrected version.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
PrzemysÅaw Koprowski, Kurt Mehlhorn, Saurabh Ray,