On the worst-case arithmetic complexity of approximating zeros of polynomials
Open Access
- 1 June 1987
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 3 (2) , 90-113
- https://doi.org/10.1016/0885-064x(87)90022-7
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- 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
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965