EPTCS 24 - CCA 2010
Xizhong Zheng, Ning Zhong (Eds.): Proceedings Seventh International Conference on Computability and Complexity in Analysis. 2010 EPTCS 24 [ contents ]- Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas: Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems. ... 7-18
- Ingo Battenfeld: A domain-theoretic investigation of posets of sub-sigma-algebras (extended abstract). ... 19-28
- Wesley Calvert, Ken Kramer, Russell Miller: The Cardinality of an Oracle in Blum-Shub-Smale Computation. ... 56-66
- Vassilios Gregoriades: The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function (Extended Abstract). ... 92-100
- Dianchen Lu, Qingyan Wang, Rui Zheng: Computing the Solutions of the Combined Korteweg-de Vries Equation by Turing Machines. ... 101-105
- Robert Rettinger: A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract). ... 120-129
- Christoph Spandl: Computational Complexity of Iterated Maps on the Interval (Extended Abstract). ... 139-150
- Thomas Steinke, Raazesh Sainudiin: A Rigorous Extension of the Schönhage-Strassen Integer Multiplication Algorithm Using Complex Interval Arithmetic. ... 151-159
- Yongcheng Wu: Complete Multi-Representations of Sets in a Computable Measure Space. ... 160-166
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team