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 degreed equalsd/2 for evend, is greater than or equal to 1 for oddd>−3, and equals 1 ford=3 or 5.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have