Journal of Complexity, Volume 2

Volume 2, Number 1, March 1986

Joseph F. Traub:
From the Editor. 1-
Michael Shub, Steve Smale:
On the existence of generally convergent algorithms. 2-11
David Lee, Grzegorz W. Wasilkowski:
Approximation of linear functionals on a banach space with a Gaussian measure. 12-43
Terrance E. Boult, Krzysztof A. Sikorski:
Complexity of computing topological degree of lipschitz functions in n dimensions. 44-59
Judea Pearl, Michael Tarsi:
Structuring causal trees. 60-77
Mario Milanese, Roberto Tempo, Antonio Vicino:
Strongly optimal algorithms and optimal information in estimation problems. 78-94

Ker-I Ko:
On the computational complexity of best Chebyshev approximations. 95-120
Yuly Makovoz:
On the Kolmogorov complexity of functions of finite smoothness. 121-130
Jacek Kuczynski:
On the optimal solution of large eigenpair problems. 131-162
Christopher A. Sikorski, Henryk Wozniakowski:
For which error criteria can we solve nonlinear equations? 163-178

Dario Bini, Victor Y. Pan:
Polynomial division and its computational complexity. 179-203
Grzegorz W. Wasilkowski:
Information of varying cardinality. 204-228
Erich Novak:
On average case errors in numerical analysis. 229-238
Marek A. Kowalski:
Optimal complexity recovery of band- and energy-limited signals. 239-254
Henryk Wozniakowski:
Probabilistic setting of information-based complexity. 255-269

D. V. Chudnovsky, G. V. Chudnovsky:
On expansion of algebraic functions in power and Puiseux series, I. 271-294
David Lee:
Fast multiplication of a recursive block Toeplitz matrix by a vector and its application. 295-305
Boleslaw Z. Kacewicz, Grzegorz W. Wasilkowski:
How powerful is continuous nonlinear information for linear problems? 306-316
Aleksei G. Sukharev:
On the existence of optimal affine methods for approximating linear functionals. 317-322
Boris S. Veroy:
An optimal algorithm for search of extrema of a bimodal function. 323-332
I. P. Huerta:
Adaption helps for some nonconvex classes. 333-352