Journal of Complexity
, Volume 3
Volume 3, Number 1, March 1987
D. V. Chudnovsky
,
G. V. Chudnovsky
:
On expansion of algebraic functions in power and Puiseux series, II.
1-25
Arthur W. Chou
:
On the optimality of Krylov information.
26-40
Boleslaw Z. Kacewicz
:
Asymptotic error of algorithms for solving nonlinear problems.
41-56
Henryk Wozniakowski
:
Average complexity for linear operators over bounded domains.
57-80
Volume 3, Number 2, June 1987
Steve Smale
:
On the topology of algorithms, I.
81-89
James Renegar
:
On the worst-case arithmetic complexity of approximating zeros of polynomials.
90-113
T. Jackowski
,
Henryk Wozniakowski
:
Complexity of approximation with relative error criterion in worst, average, and probabilistic settings.
114-135
Stephen M. Hammel
,
James A. Yorke
,
Celso Grebogi
:
Do numerical orbits of chaotic dynamical processes represent true orbits?
136-145
Vladimir J. Lumelsky
:
Algorithmic and complexity issues of robot motion in an uncertain environment.
146-182
Terrance E. Boult
:
Optimal algorithms: Tools for mathematical modeling.
183-200
James Demmel
:
The geometry of III-conditioning.
201-229
Volume 3, Number 3, September 1987
John N. Tsitsiklis
,
Zhi-Quan Luo
:
Communication complexity of convex optimization.
231-243
Edward W. Packel
:
The algorithm designer versus nature: A game-theoretic approach to information-based complexity.
244-257
Michael Shub
:
On the asymptotic behavior of the projective rescaling algorithm for linear programming.
258-269
Arthur G. Werschulz
:
An information-based approach to III-posed problems.
270-301
Donald G. Saari
:
Some informational requirements for convergence.
302-311
Charles A. Micchelli
,
T. J. Rivlin
:
An optimal recovery view of Walsh's equiconvergence theorem.
312-330
Ivo Babuska
:
Information-based numerical practice.
331-346
Aleksei G. Sukharev
:
The concept of sequential optimality for problems in numerical analysis.
347-357
Volume 3, Number 4, December 1987
David Lee
,
Theodosios Pavlidis
,
Grzegorz W. Wasilkowski
:
A note on the trade-off between sampling and quantization in signal processing.
359-371
Ilan Adler
,
Richard M. Karp
,
Ron Shamir
:
A simplex variant solving an
m
times
d
linear program in
O(min(m
2
, d
2
)
expected number of pivot steps.
372-387
Christopher (Krzysztof) Sikorski
,
Henryk Wozniakowski
:
Complexity of fixed points, I.
388-405
Edward G. Coffman Jr.
,
M. R. Garey
,
David S. Johnson
:
Bin packing with divisible item sizes.
406-428
Borislav Bojanov
:
sigma-Perfect splines and their application to optimal recovery problems.
429-450
Boleslaw Z. Kacewicz
:
Optimal solution of ordinary differential equations.
451-465
Copyright ©
Fri Dec 18 18:50:54 2009 by
Michael Ley
(
ley@uni-trier.de
)