Complexity Lower Bounds for Approximation Algebraic Computation Trees |
| |
| Authors: | Felipe Cucker Dima Grigoriev |
| |
| Affiliation: | Department of Mathematics, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong, Chinaf1;IMR, Université de Rennes I, Campus de Beaulieu, Rennes, 35042, France, f2 |
| |
| Abstract: | We prove lower bounds for approximate computations of piecewise polynomial functions which, in particular, apply for round-off computations of such functions. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
