scientific article; zbMATH DE number 7311152
From MaRDI portal
Publication:5150974
zbMath1456.03065MaRDI QIDQ5150974
Publication date: 16 February 2021
Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?CCA2010.9
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of numerations, effectively presented structures (03D45) Computation over the reals, computable analysis (03D78)
Related Items (10)
Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Many-one reductions and the category of multivalued functions ⋮ On the algebraic structure of Weihrauch degrees ⋮ Computer Science for Continuous Data ⋮ On uniform relationships between combinatorial problems ⋮ SEARCHING FOR AN ANALOGUE OF ATR0 IN THE WEIHRAUCH LATTICE ⋮ Probabilistic computability and choice ⋮ Weihrauch Complexity in Computable Analysis ⋮ Lawvere-Tierney topologies for computability theorists
This page was built for publication:
