Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average

Publisher Website

1 May 1986

journal article
Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing

Vol. 15 (2), 384-398
https://doi.org/10.1137/0215026

Abstract

No abstract available

Keywords

This publication has 4 references indexed in Scilit:

Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
SIAM Journal on Computing, 1986
Computational complexity of real functions
Theoretical Computer Science, 1982
The fundamental theorem of algebra and complexity theory
Bulletin of the American Mathematical Society, 1981
Three research problems in numerical linear algebra
Published by American Mathematical Society (AMS) ,1978

Cited by 12 articles