Journal of Complexity, Volume 25

Volume 25, Number 1, February 2009

• Joseph F. Traub:
  Editorial Board Changes. 1
  Electronic Edition (link) BibTeX
• Peter Mathé, Sergei V. Pereverzev:
  The use of higher order finite difference schemes is not dangerous. 3-10
  Electronic Edition (link) BibTeX
• Daniel Rudolf:
  Explicit error bounds for lazy reversible Markov chain Monte Carlo. 11-24
  Electronic Edition (link) BibTeX
• Rafael Grimson, Bart Kuijpers:
  Some lower bounds for the complexity of the linear programming feasibility problem over the reals. 25-37
  Electronic Edition (link) BibTeX
• Petko D. Proinov:
  General local convergence theory for a class of iterative processes and its applications to Newton's method. 38-62
  Electronic Edition (link) BibTeX
• Paul C. Kainen, Vera Kurková, Marcello Sanguineti:
  Complexity of Gaussian-radial-basis networks approximating smooth functions. 63-74
  Electronic Edition (link) BibTeX
• Fasheng Sun, Min-Qian Liu, Wenrui Hao:
  An algorithmic approach to finding factorial designs with generalized minimum aberration. 75-84
  Electronic Edition (link) BibTeX