|
This article is cited in 2 scientific papers (total in 2 papers)
Topological complexity and real roots of polynomials
V. A. Vassiliev Steklov Mathematical Institute, Russian Academy of Sciences
Abstract:
The topological complexity of an algorithm is the number of its branchings. In the paper we prove that the minimal topological complexity of an algorithm that approximately computes a root of a real polynomial of degree $d$ equals $d/2$ for even $d$, is greater than or equal to 1 for odd $d>-3$, and equals 1 for $d=3$ or 5.
Received: 13.03.1996
Citation:
V. A. Vassiliev, “Topological complexity and real roots of polynomials”, Mat. Zametki, 60:5 (1996), 670–680; Math. Notes, 60:5 (1996), 503–509
Linking options:
https://www.mathnet.ru/eng/mzm1880https://doi.org/10.4213/mzm1880 https://www.mathnet.ru/eng/mzm/v60/i5/p670
|
|