Journal of Complexity, Volume 22

Volume 22, Number 1, February 2006

• Thomas Müller-Gronbach, Erich Novak, Knut Petras:
  Special issue. 3
  
• Dirk Nuyens, Ronald Cools:
  Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points. 4-28
  
• Stephan Dahlke, Erich Novak, Winfried Sickel:
  Optimal approximation of elliptic problems by linear and nonlinear mappings I. 29-49
  
• Matthias Horn:
  Optimal algorithms for global optimization in case of unknown Lipschitz constant. 50-70
  
• Benjamin J. Waterhouse, Frances Y. Kuo, Ian H. Sloan:
  Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions. 71-101
  
• Vitaly Maiorov:
  Approximation by neural networks and learning theory. 102-117
  
• Knut Petras, Klaus Ritter:
  On the complexity of parabolic initial-value problems with variable drift. 118-145
  

Volume 22, Number 2, April 2006

• Peter Bürgisser, Felipe Cucker:
  Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets. 147-191
  
• Stefan Heinrich:
  Monte Carlo approximation of weakly singular integral operators. 192-219
  
• Stefan Heinrich:
  The randomized information complexity of elliptic PDE. 220-249
  
• Nathaniel Miller:
  Computational complexity of diagram satisfaction in Euclidean geometry. 250-274
  
• Wilfried Meidl:
  Enumeration results on linear complexity profiles and lattice profiles. 275-286
  
• Jerzy Mycka, José Félix Costa:
  The P ne NP conjecture in the context of real and complex analysis. 287-303
  

Volume 22, Number 3, June 2006

• Dennis Cheung, Felipe Cucker:
  Solving linear programs with finite precision: II. Algorithms. 305-335
  
• Peter Kritzer:
  Improved upper bounds on the star discrepancy of (t, m, s)-nets and (t, s)-sequences. 336-347
  
• Hrushikesh Narhar Mhaskar:
  Weighted quadrature formulas and approximation by zonal function networks on the sphere. 348-370
  
• Peter Mathé, Sergei V. Pereverzev:
  The discretized discrepancy principle under general source conditions. 371-381
  
• Nigang Sun, Lei Hu:
  Expansion and linear complexity of the coordinate sequences over Galois rings. 382-395
  
• Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solernó:
  On the complexity of the resolvent representation of some prime differential ideals. 396-430
  

• Thomas Brihaye, Christian Michaux:
  Corrigendum to "On the expressiveness and decidability of o-minimal hybrid systems" [J. Complexity 21 (2005) 447-478]. 431-434
  

Volume 22, Number 4, August 2006

• Giray Ökten, Bruno Tuffin, Vadim Burago:
  A central limit theorem and improved error bounds for a hybrid-Monte Carlo sequence with applications in computational finance. 435-458
  
• Andreas Neuenkirch:
  Optimal approximation of SDE's with additive fractional noise. 459-474
  
• Dan Bates, Chris Peterson, Andrew J. Sommese:
  A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set. 475-489
  
• Vassil Grozdanov:
  The weighted b-adic diaphony. 490-513
  
• Marek Szczesny:
  Complexity of initial-value problems for ordinary differential equations of order k. 514-532
  
• Jinhua Wang, Chong Li:
  Uniqueness of the singular points of vector fields on Riemannian manifolds under the gamma-condition. 533-548
  
• Stephan Dahlke, Erich Novak, Winfried Sickel:
  Optimal approximation of elliptic problems by linear and nonlinear mappings II. 549-603
  

Volume 22, Number 5, October 2006

• Leszek Plaskota, Ian H. Sloan:
  Guest Editors' preface.
  

• Ligia L. Cristea, Josef Dick, Friedrich Pillichshammer:
  On the mean square weighted L₂ discrepancy of randomized digital nets in prime base. 605-629
  
• Frances Y. Kuo, Grzegorz W. Wasilkowski, Benjamin J. Waterhouse:
  Randomly shifted lattice rules for unbounded integrands. 630-651
  
• Shu Tezuka, Anargyros Papageorgiou:
  Exact cubature for a class of functions of maximum effective dimension. 652-659
  
• Arvid J. Bessen:
  A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer. 660-675
  
• Boleslaw Z. Kacewicz:
  Almost optimal solution of initial-value problems by randomized and quantum algorithms. 676-690
  
• Stefan Heinrich:
  The quantum query complexity of elliptic PDE. 691-725
  

Volume 22, Number 6, December 2006

• Vasco Brattka, Peter Hertling, Ker-I Ko, Hideki Tsuiki:
  Computability and complexity in analysis. 728
  

• Douglas S. Bridges, Robin Havea, Peter Schuster:
  Ideals in constructive Banach algebra theory. 729-737
  
• Santiago Figueira, Frank Stephan, Guohua Wu:
  Randomness and universal machines. 738-751
  
• Peter Hertling:
  A sequentially computable function that is not effectively continuous at any point. 752-767
  
• Matthias Schröder, Alex Simpson:
  Representing probability measures using probabilistic processes. 768-782
  
• Satoru Yoshida:
  Generalized functions with pseudobounded support in constructive mathematics. 783-802
  
• Fuxiang Yu, Arthur W. Chou, Ker-I Ko:
  On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain. 803-817
  
• Robert Rettinger, Xizhong Zheng:
  A hierarchy of Turing degrees of divergence bounded computable real numbers. 818-826
  
• Martin Ziegler:
  Effectively open real functions. 827-849
  

• George Barmpalias:
  Random non-cupping revisited. 850-857
  
• Vasco Brattka, Atsushi Yoshikawa:
  Towards computability of elliptic boundary value problems in variational formulation. 858-880
  
• Douglas S. Bridges, Luminita Simona Vîta:
  Pre-apartness structures on spaces of functions. 881-893
  
• Shinji Iizuka:
  Effective continuities on effective topological spaces. 894-908
  
• Branimir Lambov:
  The basic feasible functionals in computable analysis. 909-917
  
• Klaus Weihrauch, Ning Zhong:
  Computing Schrödinger propagators on Type-2 Turing machines. 918-935