Journal of Complexity, Volume 19

Volume 19, Number 1, February 2003

• Stefan Heinrich, Erich Novak:
  On a problem in quantum summation. 1-18
  
• Stefan Heinrich:
  Quantum integration in Sobolev classes. 19-42
  
• Markus Bläser:
  On the complexity of the multiplication of matrices of small formats. 43-60
  
• Wilfried Meidl, Harald Niederreiter:
  The expected value of the joint linear complexity of periodic multisequences. 61-72
  
• Fang Gensun, Ye Peixin:
  Probabilistic and average linear widths of Sobolev space with Gaussian measure. 73-84
  
• Boleslaw Z. Kacewicz:
  How to minimize the cost of iterative methods in the presence of perturbations. 85-99
  

Volume 19, Number 2, April 2003

• Xiaoqun Wang, Kai-Tai Fang:
  The effective dimension and quasi-Monte Carlo integration. 101-124
  
• Michael Maller, Jennifer Whitehead:
  P != NC over the p-adic numbers. 125-131
  
• Hayato Takahashi, Kazuyuki Aihara:
  Algorithmic analysis of irrational rotations in a single neuron model. 132-152
  
• Steve Seif, Csaba Szabó:
  Algebra complexity problems involving graph homomorphism, semigroups and the constraint satisfaction problem. 153-160
  
• D. Castro, Luis Miguel Pardo, Jorge San Martín:
  Systems of rational polynomial equations have polynomial size approximate zeros on the average. 161-209
  

Volume 19, Number 3, June 2003

• Adhemar Bultheel, Pablo González-Vera, Erik Hendriksen, Olav Njåstad:
  Orthogonal rational functions and quadrature on the real half line. 212-230
  
• Steven B. Damelin, Peter J. Grabner:
  Energy functionals, numerical integration and asymptotic equidistribution on the sphere. 231-246
  
• Biancamaria Della Vecchia, Giuseppe Mastroianni:
  Gaussian rules on unbounded intervals. 247-258
  
• Elise de Doncker, Yuqiang Guan:
  Error bounds for the integration of singular functions using equidistributed sequences. 259-271
  
• G. A. Evans, K. C. Chung:
  Some theoretical aspects of generalised quadrature methods. 272-285
  
• Fred J. Hickernell, Harald Niederreiter:
  The existence of good extensible rank-1 lattices. 286-300
  
• Frances Y. Kuo:
  Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces. 301-320
  
• James N. Lyness:
  Notes on lattice rules. 321-331
  
• Anargyros Papageorgiou:
  Sufficient conditions for fast quasi-Monte Carlo convergence. 332-351
  
• Vladimir N. Temlyakov:
  Cubature formulas, discrepancy, and nonlinear approximation. 352-391
  
• Yuan Xu:
  Lower bound for the number of nodes of cubature formulae on the unit ball. 392-402
  
• Ronald Cools, Hans Joachim Schmid:
  On the (non)-existence of some cubature formulas: gaps between a theory and its applications. 403-405
  
• Steven B. Damelin:
  Marcinkiewicz-Zygmund inequalities and the numerical approximation of singular integrals for exponential weights: methods, results and open problems, some new, some old. 406-415
  
• Stefan Heinrich:
  Some open problems concerning the star-discrepancy. 416-419
  
• Fred J. Hickernell:
  My dream quadrature rule. 420-427
  
• Harald Niederreiter:
  Some current issues in quasi-Monte Carlo methods. 428-433
  
• Henryk Wozniakowski:
  Open problems for tractability of multivariate integration. 434-444
  
• Ronald Cools:
  An encyclopaedia of cubature formulas. 445-453
  

Volume 19, Number 4, August 2003

• Adam Lutoborski, Vladimir N. Temlyakov:
  Vector greedy algorithms. 458-473
  
• Asa Ben-Hur, Joshua Feinberg, Shmuel Fishman, Hava T. Siegelmann:
  Probabilistic analysis of a differential equation for linear programming. 474-510
  
• Gerhard Larcher, Gunther Leobacher, Klaus Scheicher:
  On the tractability of the Brownian Bridge algorithm. 511-528
  
• Gunther Leobacher, Friedrich Pillichshammer:
  Bounds for the weighted L^p discrepancy and tractability of integration. 529-547
  
• Juan Antonio Cuesta-Albertos, Mario Wschebor:
  Some remarks on the condition number of a real random square matrix. 548-554
  
• Dorota Dabrowska:
  Linear algorithms for recovering linear functionals from jittered information. 555-563
  
• Grégoire Lecerf:
  Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. 564-596
  
• Yoojin Chung, Kunsoo Park:
  An efficient parallel algorithm for scheduling interval ordered tasks. 597-609
  
• Fang Gensun, Ye Peixin:
  Integration error for multivariate functions from anisotropic classes . 610-627
  

Volume 19, Number 5, October 2003

• Daniel Richardson, Ahmed El-Sonbaty:
  Use of algebraically independent numbers for zero recognition of polynomial terms. 631-637
  
• Jakub Onufry Wojtaszczyk:
  Multivariate integration in C^infinity([0, 1]^d) is not strongly tractable. 638-643
  
• Daniel Silva Graça, José Félix Costa:
  Analog computers and recursive functions over the reals. 644-664
  
• Massimiliano Pontil:
  A note on different covering numbers in learning theory. 665-671
  
• Robert Rettinger, Xizhong Zheng:
  On the hierarchy and extension of monotonically computable real numbers. 672-691
  
• Kai-Tai Fang, Xuan Lu, Peter Winker:
  Lower bounds for centered and wrap-around L₂-discrepancies and construction of uniform designs by threshold accepting. 692-711
  

Volume 19, Number 6, December 2003

• Ronald Cools, Hilde Govaert:
  Five- and six-dimensional lattice rules generated by structured matrices. 715-729
  
• Marek Kwas, Youming Li:
  Worst case complexity of multivariate Feynman-Kac path integration. 730-743
  
• Shu Tezuka, Henri Faure:
  I-binomial scrambling of digital nets and sequences. 744-757
  
• Arthur G. Werschulz:
  Where does smoothness count the most for Fredholm equations of the second kind with noisy information? 758-798
  
• Spencer D. Shellman, Christopher (Krzysztof) Sikorski:
  A recursive algorithm for the infinity-norm fixed point problem. 799-834