Volume 10, Number 1, March 1994
: Is It Possible to Know a Problem Instance Is Ill-Posed?: Some Foundations for a General Theory of Condition Numbers.
: Tractability and Strong Tractability of Linear Multivariate Problems.
Volume 10, Number 2, June 1994
: One-Way Communication Complexity of Computing a Collection of Rational Functions.
Florian A. Potra
: Efficient Hybrid Algorithms for Finding Zeros of Convex Functions.
, J. Michael Steele
: General Spacefilling Curve Heuristics and Limit Theory for the Traveling Salesman Problem.
Nikolaj P. Korneichuk
: Optimization of Active Algorithms for Recovery of Monotonic Functions from Hölder's Class.
Volume 10, Number 3, September 1994
: Combining Binary Search and Newton's Method to Compute Real Roots for a Class of Real Functions.
: The Complexity and Effectiveness of Prediction Algorithms.
Mark A. Kon
: On the delta->0 Limit in Probabilistic Complexity.
Volume 10, Number 4, December 1994
Arthur G. Werschulz
: The Complexity of Two-Point Boundary-Value Problems with Piecewise Analytic Data.
Sung Hee Choi
: Probabilistic Analysis of Simpson's Quadrature.
Chi Tat Chong
: Positive Reducibility of the Interior of Filled Julia Sets.
: There Exists a Problem Whose Computational Complexity Is Any Given Function of the Information Complexity.