Journal: J. Complexity

Volume 13, Issue 4

385 -- 0Joseph F. Traub. A Note from the Editor
386 -- 0Erich Novak. Editor s Foreword: Dagstuhl Invited Papers
387 -- 418Erich Novak, Ian H. Sloan, Henryk Wozniakowski. Tractability of Tensor Product Linear Operators
419 -- 456Gianna M. Del Corso, Giovanni Manzini. On the Randomized Error of Polynomial Methods for Eigenvector and Eigenvalue Estimates
457 -- 479Arthur G. Werschulz. The Complexity of Indefinite Elliptic Problems with Noisy Data
480 -- 488Nicholas N. Vakhania. Polya s Characterization Theorem for Complex Random Variables
489 -- 508Ronald A. DeVore, Vladimir N. Temlyakov. Nonlinear Approximation in Finite-Dimensional Spaces
509 -- 543Joel Ratsaby, Vitaly Maiorov. On the Value of Partial Information for Learning from Examples

Volume 13, Issue 3

301 -- 0. Best Paper Award
303 -- 325Ernst W. Mayr. Some Complexity Results for Polynomial Ideals
326 -- 329Alberto Bertoni, Paola Campadelli, Cristina Gangai, Roberto Posenato. Approximability of the Ground State Problem for Certain Ising Spin Glasses
340 -- 352Yair Caro, Raphael Yuster. Recognizing Global Occurrence of Local Properties
353 -- 383Harald Niederreiter, Michael Vielhaber. Linear Complexity Profiles: Hausdorff Dimensions for Almost Perfect Profiles and Measures for General Profiles

Volume 13, Issue 2

195 -- 207Michael Maller, Jennifer Whitehead. Computational Complexity over thep-adic Numbers
208 -- 234Israel Gohberg, Vadim Olshevsky. The Fast Generalized Parker-Traub Algorithm for Inversion of Vandermonde and Related Matrices
235 -- 258Ronald Cools, Andrew V. Reztsov. Different Quality Indexes for Lattice Rules
259 -- 271Christine Gaßner. On NP-Completeness for Linear Machines
272 -- 278Misako Yokoyama. Computing the Topological Degree with Noisy Information
279 -- 300Valentin E. Brimkov, Stefan S. Dantchev. Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model

Volume 13, Issue 1

1 -- 0Joseph F. Traub. Best Paper Award
2 -- 3Michael Shub. Guest Editor s Introduction
5 -- 27Bernd Bank, Marc Giusti, Joos Heintz, Guy M. Mbakop. Polar Varieties, Real Equation Solving, and Data Structures: The Hypersurface Case
28 -- 37Saugata Basu, Richard Pollack, Marie-Françoise Roy. On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety
38 -- 41Walter Baur. Simplified Lower Bounds for Polynomials with Algebraic Coefficients
42 -- 49Don Coppersmith. Rectangular Matrix Multiplication Revisited
50 -- 64Dima Grigoriev. Nearly Sharp Complexity Bounds for Multiprocessor Algebraic Computations
65 -- 82Pascal Koiran. Elimination of Constants from Machines over Algebraically Closed Fields
83 -- 107Thomas Lickteig, Klaus Meer. Semi-algebraic Complexity--Additive Complexity of Matrix Computational Tasks
108 -- 124Victor Y. Pan, Ailong Zheng, Xiaohan Huang, Olen Dias. Newton s Iteration for Inversion of Cauchy-Like and Other Structured Matrices
125 -- 179Charles Pugh, Michael Shub. Stably Ergodic Dynamical Systems and Partial Hyperbolicity
180 -- 193Madhu Sudan. Decoding of Reed Solomon Codes beyond the Error-Correction Bound