Topological complexity of zero finding with algebraic operations
type: Item
instance of: scholarly article
title: Topological complexity of zero finding with algebraic operations
zbMATH Open document ID: 1030.68049
author: P. H. Hertling
published in: Journal of Complexity
publication date: 2003-05-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 1910727
zbMATH Keywords: topological complexity
zbMATH Keywords: zero finding
zbMATH Keywords: algebraic operations
zbMATH Keywords: oracle machine over
zbMATH Keywords: the real numbers
zbMATH Keywords: information-based complexity
MaRDI profile type: Publication
full work available at URL: jcom.2002.0648
OpenAlex ID: W2034091147
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Randomization and the computational power of analytic and algebraic decision trees
cites work: Topological complexity with continuous operations
cites work: The real number model in numerical analysis
cites work: Topological complexity of zero-finding
cites work: On the topology of algorithms. I
cites work: Q4717968
cites work: On decision trees for orthants
DOI: 10.1006/JCOM.2002.0648
description: scientific article; zbMATH DE number 1910727