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 Volume=12
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quadrature formulas for multivariate convex functions
Carsten Katscher
,
Erich Novak
,
Knut Petras
Journal of Complexity
12
(1), 1996, pp. 5-16
Information complexity of multivariate Fredholm integral equations in Sobolev classes
Karin Frank
,
Stefan Heinrich
,
Sergei Pereverzev
Journal of Complexity
12
(1), 1996, pp. 17-34
Optimal recovery of periodic functions from Fourier coefficients given with an error
K.Yu. Osipenko
Journal of Complexity
12
(1), 1996, pp. 35-46
About widths of Wiener space in the
L_q
-norm
V.E. Maiorov
Journal of Complexity
12
(1), 1996, pp. 47-57
n
-widths, Faber expansion, and computation of analytic functions
Yu.A. Farkov
Journal of Complexity
12
(1), 1996, pp. 58-79
An efficient algorithm for the complex roots problem
C. Andrew Neff
,
John H. Reif
Journal of Complexity
12
(2), 1996, pp. 81-115
Counting affine roots of polynomial systems via pointed Newton polytopes
J. Maurice Rojas
,
Xiaoshen Wang
Journal of Complexity
12
(2), 1996, pp. 116-133
On the complexity of sparse elimination
Ioannis Z. Emiris
Journal of Complexity
12
(2), 1996, pp. 134-166
Complexity estimates for the Schmüdgen positivstellensatz
Gilbert Stengle
Journal of Complexity
12
(2), 1996, pp. 167-174
How to benefit from noise
Leszek Plaskota
Journal of Complexity
12
(2), 1996, pp. 175-184
Tree complexity and a doubly exponential gap between structured and random sequences
Harald Niederreiter
,
Michael Vielhaber
Journal of Complexity
12
(3), 1996, pp. 187-198
On the power of adaption
Erich Novak
Journal of Complexity
12
(3), 1996, pp. 199-237
On speed versus accuracy: Some case studies
Mauro Leoncini
Journal of Complexity
12
(3), 1996, pp. 239-253
Average case complexity of multivariate integration and function approximation
G.W. Wasilkowski
Journal of Complexity
12
(4), 1996, pp. 257-272
Hilbert's Nullstellensatz is in the polynomial hierarchy
Pascal Koiran
Journal of Complexity
12
(4), 1996, pp. 273-286
Computing discrepancies of Smolyak quadrature rules
Karin Frank
,
Stefan Heinrich
Journal of Complexity
12
(4), 1996, pp. 287-314
Topological complexity with continuous operations
Peter Hertling
Journal of Complexity
12
(4), 1996, pp. 315-338
On the expected number of shadow vertices of the convex hull of random points
K.-H. Küfer
Journal of Complexity
12
(4), 1996, pp. 339-357
Numerical integration of peak functions
Erich Novak
,
Ingo Roschmann
Journal of Complexity
12
(4), 1996, pp. 358-379
Topological complexity of zero-finding
Erich Novak
,
Henryk Woźniakowski
Journal of Complexity
12
(4), 1996, pp. 380-400
The minimal radius of Galerkin information for the Fredholm problem of the first kind
S.V. Pereverzev
,
S.G. Solodky
Journal of Complexity
12
(4), 1996, pp. 401-415
Worst case complexity of problems with random information noise
Leszek Plaskota
Journal of Complexity
12
(4), 1996, pp. 416-439
The complexity of definite elliptic problems with noisy data
Arthur G. Werschulz
Journal of Complexity
12
(4), 1996, pp. 440-473
A linear programming instance with many crossover events
Shinji Mizuno
,
Nimrod Megiddo
,
Takashi Tsuchiya
Journal of Complexity
12
(4), 1996, pp. 474-479
How partial knowledge helps to solve linear programs
Yinyu Ye
Journal of Complexity
12
(4), 1996, pp. 480-491
Seiten 1
2
>