Complexity lower bounds for approximation algebraic computation trees

Authors
Cucker, F Grigoriev, D
Citation
F. Cucker et D. Grigoriev, Complexity lower bounds for approximation algebraic computation trees, J COMPLEX, 15(4), 1999, pp. 499-512
Citations number
14
Categorie Soggetti
Engineering Mathematics
Journal title
JOURNAL OF COMPLEXITY
ISSN journal
0885064X → ACNP
Volume
15
Issue
4
Year of publication
1999
Pages
499 - 512
Database
ISI
SICI code
0885-064X(199912)15:4<499:CLBFAA>2.0.ZU;2-6
Abstract
We prove lower bounds for approximate computations of piecewise polynomial functions which, in particular, apply for round-off computations of such fu nctions. (C) 1999 Academic Press.