Topological complexity and real roots of polynomials
- 34 Downloads
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 degreed equalsd/2 for evend, is greater than or equal to 1 for oddd>−3, and equals 1 ford=3 or 5.
Key wordsnumber of branchings of an algorithm topological complexity real roots of a polynomial approximate real root
Unable to display preview. Download preview PDF.
- 2.V. A. Vassiliev, “Cohomology of braid groups and complexity of algoritnms,”Funktsional. Anal, i Prilozhen. [Functional. Anal. Appl.],22, No. 3 (1988).Google Scholar
- 4.V. A. Vassiliev,Complements of Discriminants of Smooth Maps: Topology and Applications, Revised edition. Translations of Math. Monographs, Vol. 98, Amer. Math. Soc., Providence, R.I. (1994).Google Scholar