Journal of Complexity

FROM THE EDITOR
pp. 679-679(1)
Author: Traub J.F.

2001 Best Paper Award
pp. 680-680(1)
Authors: Niederreiter H.; Traub J.F.; Woniakowski H.

2002 Best Paper Award Committee
pp. 681-681(1)
Authors: Hickernell F.J.; Mathe P.

2002 Prize for Achievement in Information-Based Complexity
pp. 682-682(1)

A Constructive Approach to Strong Tractability Using Quasi-Monte Carlo Algorithms
pp. 683-701(19)
Author: Wang X.

Complexity of Nonlinear Two-Point Boundary-Value Problems
pp. 702-738(37)
Author: Kacewicz B.

The covering number in learning theory
pp. 739-767(29)
Author: Zhou D-X.

Support Vector Machines are Universally Consistent
pp. 768-791(24)
Author: Steinwart I.

Applicability of Smolyak's Algorithms to Certain Banach Spaces of Multivariate Functions
pp. 792-814(23)
Author: Li Y.

The Infinite-Dimensional Widths and Optimal Recovery of Generalized Besov Classes
pp. 815-832(18)
Authors: Yongping L.; Guiqiao X.

Interior-Point Methods: Worst Case and Average Case Analysis of a Phase-I Algorithm and a Termination Procedure
pp. 833-910(78)
Authors: Huhn P.; Borgwardt K.H.