Topological complexity with continuous operations

DOI10.1006/JCOM.1996.0021zbMath0862.68060OpenAlexW2020204406MaRDI QIDQ2365410

Peter H. Hertling

Publication date: 25 May 1997

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

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

zbMATH Keywords

topological complexity of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (19)

Topological complexity of zero finding with algebraic operations ⋮ Three topological reducibilities for discontinuous functions ⋮ Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Hierarchies of Δ⁰₂‐measurable k ‐partitions ⋮ Computability on the Countable Ordinals and the Hausdorff-Kuratowski Theorem (Extended Abstract) ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Hierarchies of function classes defined by the first-value operator ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ Borel-Piecewise Continuous Reducibility for Uniformization Problems ⋮ Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions ⋮ Complexity of linear problems with a fixed output basis ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Finitely continuous Darboux functions ⋮ Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization ⋮ Wadge hardness in Scott spaces and its effectivization ⋮ A refined model of computation for continuous problems ⋮ Why does information-based complexity use the real number model? ⋮ Probabilistic computability and choice ⋮ Weihrauch Complexity in Computable Analysis

This page was built for publication: Topological complexity with continuous operations