Volume 22, Number 1, February 2006 Special Issue - Algorithms and Complexity for Continuous Problems
, Ronald Cools
: Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points.
: Optimal algorithms for global optimization in case of unknown Lipschitz constant.
: Approximation by neural networks and learning theory.
Volume 22, Number 2, April 2006
: Monte Carlo approximation of weakly singular integral operators.
: The randomized information complexity of elliptic PDE.
: Computational complexity of diagram satisfaction in Euclidean geometry.
: Enumeration results on linear complexity profiles and lattice profiles.
Volume 22, Number 3, June 2006
: Improved upper bounds on the star discrepancy of (t, m, s)-nets and (t, s)-sequences.
, Lei Hu
: Expansion and linear complexity of the coordinate sequences over Galois rings.
, Christian Michaux
: Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478].
Volume 22, Number 4, August 2006
, Bruno Tuffin
, Vadim Burago
: A central limit theorem and improved error bounds for a hybrid-Monte Carlo sequence with applications in computational finance.
: Optimal approximation of SDE's with additive fractional noise.
: Complexity of initial-value problems for ordinary differential equations of order k.
, Chong Li
: Uniqueness of the singular points of vector fields on Riemannian manifolds under the gamma-condition.
Volume 22, Number 5, October 2006 Special Issue:
Information-Based Complexity Workshops FoCM Conference Santander, Spain, July 2005
Volume 22, Number 6, December 2006 Computability and Complexity in Analysis
Papers Presented at CCA 2005
: A sequentially computable function that is not effectively continuous at any point.
: Generalized functions with pseudobounded support in constructive mathematics.
: Effective continuities on effective topological spaces.
: The basic feasible functionals in computable analysis.