If you are experiencing problems downloading PDF or HTML fulltext, our helpdesk recommend clearing your browser cache and trying again. If you need help in clearing your cache, please click here . Still need help? Email help@ingentaconnect.com

Complexity Lower Bounds for Approximation Algebraic Computation Trees

The full text article is not available for purchase.

The publisher only permits individual articles to be downloaded by subscribers.

Abstract:

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

Document Type: Research Article

Affiliations: 1: Department of Mathematics, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong, China 2: IMR, Université de Rennes I, Campus de Beaulieu, Rennes, 35042, France

Publication date: December 1, 1999

Related content

Tools

Favourites

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more