Journal: J. Complexity

Volume 18, Issue 3

679 -- 0Joseph F. Traub. FROM THE EDITOR
680 -- 0Harald Niederreiter, Joseph F. Traub, Henryk Wozniakowski. 2001 Best Paper Award
681 -- 0Fred J. Hickernell, Peter Mathé. 2002 Best Paper Award Committee
682 -- 0. 2002 Prize for Achievement in Information-Based Complexity
683 -- 701Xiaoqun Wang. A Constructive Approach to Strong Tractability Using Quasi-Monte Carlo Algorithms
702 -- 738Boleslaw Z. Kacewicz. Complexity of Nonlinear Two-Point Boundary-Value Problems
739 -- 767Ding-Xuan Zhou. The covering number in learning theory
768 -- 791Ingo Steinwart. Support Vector Machines are Universally Consistent
792 -- 814Youming Li. Applicability of Smolyak s Algorithms to Certain Banach Spaces of Multivariate Functions
815 -- 832Liu Yongping, Xu Guiqiao. The Infinite-Dimensional Widths and Optimal Recovery of Generalized Besov Classes
833 -- 910Petra Huhn, Karl Heinz Borgwardt. Interior-Point Methods: Worst Case and Average Case Analysis of a Phase-I Algorithm and a Termination Procedure