Topological complexity of zero finding with algebraic operations

DOI10.1006/jcom.2002.0648zbMath1030.68049OpenAlexW2034091147MaRDI QIDQ1872637

Peter H. Hertling

Publication date: 14 May 2003

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.2002.0648

zbMATH Keywords

topological complexityinformation-based complexityalgebraic operationszero findingoracle machine overthe real numbers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (2)

Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ Stability versus speed in a computable algebraic model

Cites Work

• Unnamed Item
• On decision trees for orthants
• On the topology of algorithms. I
• The real number model in numerical analysis
• Randomization and the computational power of analytic and algebraic decision trees
• Topological complexity with continuous operations
• Topological complexity of zero-finding
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

This page was built for publication: Topological complexity of zero finding with algebraic operations