Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Complexity AND YEAR=1987
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On expansion of algebraic functions in power and Puiseux series, II
D.V. Chudnovsky
,
G.V. Chudnovsky
Journal of Complexity
3
, 1987, pp. 1-25
On the optimality of Krylov information
Arthur W. Chou
Journal of Complexity
3
, 1987, pp. 26-40
Asymptotic error of algorithms for solving nonlinear problems
B.Z. Kacewicz
Journal of Complexity
3
, 1987, pp. 41-56
Average complexity for linear operators over bounded domains
H. Woźniakowski
Journal of Complexity
3
, 1987, pp. 57-80
On the topology of algorithms, I
Steve Smale
Journal of Complexity
3
, 1987, pp. 81-89
On the worst-case arithmetic complexity of approximating zeros of polynomials
James Renegar
Journal of Complexity
3
, 1987, pp. 90-113
Complexity of approximation with relative error criterion in worst, average, and probabilistic settings
T. Jackowski
,
H. Woźniakowski
Journal of Complexity
3
, 1987, pp. 114-135
Algorithmic and complexity issues of robot motion in an uncertain environment
Vladimir J. Lumelsky
Journal of Complexity
3
, 1987, pp. 146-182
Optimal algorithms: Tools for mathematical modeling
Terrance E. Boult
Journal of Complexity
3
, 1987, pp. 183-200
The geometry of ill-conditioning
James W. Demmel
Journal of Complexity
3
, 1987, pp. 201-229
Communication complexity of convex optimization
John N. Tsitsiklis
,
Zhi-Quan Luo
Journal of Complexity
3
, 1987, pp. 231-243
The algorithm designer versus nature: A game-theoretic approach to information-based complexity
Edward W. Packel
Journal of Complexity
3
, 1987, pp. 244-257
On the asymptotic behavior of the projective rescaling algorithm for linear programming
Michael Shub
Journal of Complexity
3
, 1987, pp. 258-269
An information-based approach to ill-posed problems
Arthur G. Werschulz
Journal of Complexity
3
, 1987, pp. 270-301
Some informational requirements for convergence
Donald G. Saari
Journal of Complexity
3
, 1987, pp. 302-311
An optimal recovery view of Walsh's equiconvergence theorem
Charles A. Micchelli
,
T.J. Rivlin
Journal of Complexity
3
, 1987, pp. 312-330
Information-based numerical practice
I. Babus̑ka
Journal of Complexity
3
, 1987, pp. 331-346
The concept of sequential optimality for problems in numerical analysis
Aleksei G. Sukharev
Journal of Complexity
3
, 1987, pp. 347-357
A note on the trade-off between sampling and quantization in signal processing
D. Lee
,
T. Pavlidis
,
G.W. Wasilkowski
Journal of Complexity
3
, 1987, pp. 359-371
A simplex variant solving an
m\times d
linear program in
O(\min(m^2, d^2)
expected number of pivot steps
Ilan Adler
,
Richard M. Karp
,
Ron Shamir
Journal of Complexity
3
, 1987, pp. 372-387
Complexity of fixed points, I
K. Sikorski
,
H. Woźniakowski
Journal of Complexity
3
, 1987, pp. 388-405
Bin packing with divisible item sizes
E.G., Jr. Coffman
,
M.R. Garey
,
D.S. Johnson
Journal of Complexity
3
, 1987, pp. 406-428
\sigma
-perfect splines and their application to optimal recovery problems
Borislav Bojanov
Journal of Complexity
3
, 1987, pp. 429-450
Optimal solution of ordinary differential equations
B.Z. Kacewicz
Journal of Complexity
3
, 1987, pp. 451-465