Journal ArticleOPEN ACCESS

Complexity lower bounds for approximation algebraic computation trees

Journal of Complexity (1999) 15(4) 499-512
DOI: 10.1006/jcom.1999.0519
5Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We prove lower bounds for approximate computations of piecewise polynomial functions which, in particular, apply for round-off computations of such functions. © 1999 Academic Press.

Cite

CITATION STYLE

APA

Cucker, F., & Grigoriev, D. (1999). Complexity lower bounds for approximation algebraic computation trees. Journal of Complexity, 15(4), 499–512. https://doi.org/10.1006/jcom.1999.0519

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free