default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID5th CCA 2008: Hagen, Germany
- Vasco Brattka, Ruth Dillhage, Tanja Grubba, Angela Klutsch:
Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, CCA 2008, Hagen, Germany, August 21-24, 2008. Electronic Notes in Theoretical Computer Science 221, Elsevier 2008 - Vasco Brattka
, Ruth Dillhage, Tanja Grubba, Angela Klutsch:
Preface. 1 - Jens Blanck, Viggo Stoltenberg-Hansen, John V. Tucker:
Stability for Effective Algebras. 3-15 - Volker Bosserhoff:
On the Effective Existence of Schauder Bases: (Extended Abstract). 17-21 - Manuel Lameiras Campagnolo, Kerry Ojakian:
Characterizing Computable Analysis with Differential Equations. 23-35 - Pieter Collins:
Computability and Representations of the Zero Set. 37-43 - Ruth Dillhage, Vasco Brattka:
Computability of the Metric Projection Onto Finite-dimensional Linear Subspaces. 45-60 - Willem L. Fouché:
An Algorithmic Construction of Quantum Circuits of High Descriptive Complexity. 61-69 - Christine Gaßner:
On Relativizations of the P =? NP Question for Several Structures. 71-83 - Guido Gherardi, Alberto Marcone:
How Incomputable is the Separable Hahn-Banach Theorem? 85-102 - Pieter Collins, Daniel Silva Graça:
Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach. 103-114 - Margarita V. Korovina, Oleg V. Kudinov:
Towards Computability over Effectively Enumerable Topological Spaces. 115-125 - Valentin V. Andreev, Dale Daniel, Timothy H. McNicholl:
Technical Report: Computation on the Extended Complex Plane and Conformal Mapping of Multiply-connected Domains. 127-139 - Takakazu Mori, Mariko Yasugi, Yoshiki Tsujii:
Integral of Two-dimensional Fine-computable Functions. 141-152 - Martin Ziegler, Wouter M. Koolen:
Kolmogorov Complexity Theory over the Reals. 153-169 - Davorin Lesnik:
Constructive Urysohn's Universal Metric Space. 171-179 - Jöran Mielke:
Refined Bounds on Kolmogorov Complexity for omega-Languages. 181-189 - Norbert Th. Müller, Xishun Zhao:
Jordan Areas and Grids. 191-206 - Robert Rettinger:
Lower Bounds on the Continuation of Holomorphic Functions. 207-217 - Robert Rettinger, Klaus Weihrauch, Ning Zhong:
Complexity of Blowup Problems: Extended Abstract. 219-230 - Matthias Schröder:
An Effective Tietze-Urysohn Theorem for QCB-Spaces: (Extended Abstract). 231-242 - Svetlana Selivanova, Victor L. Selivanov:
Computing Solutions of Symmetric Hyperbolic Systems of PDE's. 243-255 - Victor L. Selivanov:
On the Difference Hierarchy in Countably Based T0-Spaces. 257-269 - Dieter Spreen:
On the Continuity of Effective Multifunctions. 271-286 - Ludwig Staiger:
On Oscillation-free epsilon-random Sequences. 287-297 - Hideki Tsuiki, Shuji Yamada:
On Finite-time Computability Preserving Conversions. 299-308
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-29 00:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
