Topological complexity of a root finding algorithm
- 1 September 1989
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 5 (3) , 331-344
- https://doi.org/10.1016/0885-064x(89)90029-0
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On approximate zeros and rootfinding algorithms for a complex polynomialMathematics of Computation, 1988
- On the topology of algorithms, IJournal of Complexity, 1987
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: IISIAM Journal on Computing, 1986
- On the efficiency of algorithms of analysisBulletin of the American Mathematical Society, 1985
- The fundamental theorem of algebra and complexity theoryBulletin of the American Mathematical Society, 1981