Journal of Complexity, Volume 10

Volume 10, Number 1, March 1994

• James Renegar:
  Is It Possible to Know a Problem Instance Is Ill-Posed?: Some Foundations for a General Theory of Condition Numbers. 1-56
  Electronic Edition (link) BibTeX
• Michel Cosnard, Pascal Koiran, Hélène Paugam-Moisy:
  Bounds on the Number of Units for Computing Arbitrary Dichotomies by Multilayer Perceptrons. 57-63
  Electronic Edition (link) BibTeX
• Ron Shonkwiler, Erik S. Van Vleck:
  Parallel Speed-Up of Monte Carlo Methods for Global Optimization. 64-95
  Electronic Edition (link) BibTeX
• Henryk Wozniakowski:
  Tractability and Strong Tractability of Linear Multivariate Problems. 96-128
  Electronic Edition (link) BibTeX
• Karl Heinz Borgwardt, Jürgen Brzank:
  Average Saving Effects in Enumerative Methods for Solving Knapsack Problems. 129-141
  Electronic Edition (link) BibTeX
• Adam W. Bojanczyk, Georg Heinig:
  A Multi-step Algorithm for Hankel Matrices. 142-164
  Electronic Edition (link) BibTeX
• Yaser S. Abu-Mostafa:
  Learning from Hints. 165-178
  Electronic Edition (link) BibTeX

Volume 10, Number 2, June 1994

• Zhi-Quan Luo:
  One-Way Communication Complexity of Computing a Collection of Rational Functions. 179-198
  Electronic Edition (link) BibTeX
• Florian A. Potra:
  Efficient Hybrid Algorithms for Finding Zeros of Convex Functions. 199-215
  Electronic Edition (link) BibTeX
• Moshe Dror, Benjamin T. Smith, Martin Trudeau:
  Utilizing Shelve Slots: Sufficiency Conditions for Some Easy Instances of Hard Problems. 216-229
  Electronic Edition (link) BibTeX
• Jun Gao, J. Michael Steele:
  General Spacefilling Curve Heuristics and Limit Theory for the Traveling Salesman Problem. 230-245
  Electronic Edition (link) BibTeX
• Steven A. Moyer, William A. Wulf:
  Modeling Optimal Effective Bandwidth of Page-Mode Memory for Stream-Oriented Computations. 246-264
  Electronic Edition (link) BibTeX
• Nikolaj P. Korneichuk:
  Optimization of Active Algorithms for Recovery of Monotonic Functions from Hölder's Class. 265-269
  Electronic Edition (link) BibTeX

Volume 10, Number 3, September 1994

• Yinyu Ye:
  Combining Binary Search and Newton's Method to Compute Real Roots for a Class of Real Functions. 271-280
  Electronic Edition (link) BibTeX
• Boris Ryabko:
  The Complexity and Effectiveness of Prediction Algorithms. 281-295
  Electronic Edition (link) BibTeX
• Paola Favati, Grazia Lotti, Gaspare Di Marco, Francesco Romani:
  Asymptotic Behavior of Automatic Quadrature. 296-340
  Electronic Edition (link) BibTeX
• Nicholas N. Vakhania:
  On Boundary Value Problems for the Hyperbolic Case. 341-355
  Electronic Edition (link) BibTeX
• Mark A. Kon:
  On the delta->0 Limit in Probabilistic Complexity. 356-365
  Electronic Edition (link) BibTeX

Volume 10, Number 4, December 1994

• Arthur G. Werschulz:
  The Complexity of Two-Point Boundary-Value Problems with Piecewise Analytic Data. 367-383
  Electronic Edition (link) BibTeX
• Sung Hee Choi:
  Probabilistic Analysis of Simpson's Quadrature. 384-410
  Electronic Edition (link) BibTeX
• Israel Gohberg, Vadim Olshevsky:
  Fast Algorithms with Preprocessing for Matrix-Vector Multiplication Problems. 411-427
  Electronic Edition (link) BibTeX
• Yongsheng Sun, Chengyong Wang:
  mu-Average n-Widths on the Wiener Space. 428-436
  Electronic Edition (link) BibTeX
• Chi Tat Chong:
  Positive Reducibility of the Interior of Filled Julia Sets. 437-444
  Electronic Edition (link) BibTeX
• Ming Chu:
  There Exists a Problem Whose Computational Complexity Is Any Given Function of the Information Complexity. 445-450
  Electronic Edition (link) BibTeX
• Arkadi Nemirovski:
  On Parallel Complexity of Nonsmooth Convex Optimization. 451-463
  Electronic Edition (link) BibTeX