Complexity lower bounds for approximation algebraic computation trees
type: Item
instance of: scholarly article
title: Complexity lower bounds for approximation algebraic computation trees
zbMATH Open document ID: 0959.68143
author: Felipe Cucker
author: Dima Grigoriev
published in: Journal of Complexity
publication date: 2000-09-03T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 1499173
zbMATH Keywords: approximate computations
Wikidata QID: Q57733282
MaRDI profile type: Publication
OpenAlex ID: W1970197763
cites work: Complexity estimates depending on condition and round-off error
cites work: Q4348513
cites work: Nearly sharp complexity bounds for multiprocessor algebraic computations
cites work: Q4542540
cites work: An exponential lower bound on the size of algebraic decision trees for MAX
cites work: Q4231918
cites work: Lower bounds for arithmetic networks
cites work: On the worst-case arithmetic complexity of approximating zeros of polynomials
cites work: On the topology of algorithms. I
cites work: The Computational Complexity of Continued Fractions
cites work: Q4004217
DOI: 10.1006/JCOM.1999.0519
description: scientific article; zbMATH DE number 1499173