Complexity lower bounds for approximation algebraic computation trees

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

5 Scopus Citations
Scopus Metrics
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)499-512
Journal / PublicationJournal of Complexity
Volume15
Issue number4
Publication statusPublished - Dec 1999

Link(s)

DOI

DOI
Check@CityULib
Link to Scopus https://www.scopus.com/record/display.uri?eid=2-s2.0-0346728832&origin=recordpage
Permanent Link https://scholars.cityu.edu.hk/en/publications/publication(7dcafe37-235c-4115-9b4f-f83d69179e55).html

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.

Fingerprint

Publication fingerprints text

100
Bounds Mathematics
100
Approximation Mathematics
100
Tree Mathematics
100
Academic Press Keyphrases
100
Round-off Keyphrases
100
Complexity Lower Bo... Keyphrases
100
Piecewise Polynomia... Keyphrases
100
Computation Tree Keyphrases
100
Approximate Computi... Keyphrases
100
Algebraic Computati... Keyphrases
Full Fingerprint ›

Citation Format(s)

[ RIS ] [ BibTeX ]
Complexity lower bounds for approximation algebraic computation trees. / Cucker, Felipe; Grigoriev, Dima.
In: Journal of Complexity, Vol. 15, No. 4, 12.1999, p. 499-512.

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review