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=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Explicit cost bounds of algorithms for multivariate tensor product problems
Grzegorz W. Wasilkowski
,
Henryk Woźniakowski
Journal of Complexity
11
(1), 1995, pp. 1-56
The real number model in numerical analysis
Erich Novak
Journal of Complexity
11
(1), 1995, pp. 57-73
Average error bounds of best approximation of continuous functions on the Wiener space
Yongsheng Sun
,
Chenyong Wang
Journal of Complexity
11
(1), 1995, pp. 74-104
Termination criteria for linear problems
Spassimir H. Paskov
Journal of Complexity
11
(1), 1995, pp. 105-137
On the complexity of approximating extremal determinants in matrices
Leonid Khachiyan
Journal of Complexity
11
(1), 1995, pp. 138-153
The complexity of multivariate elliptic problems with analytic data
Arthur G. Werschulz
Journal of Complexity
11
(1), 1995, pp. 154-173
Complexity of finding irreducible components of a semialgebraic set
André Galligo
,
Nicolai Vorobjov
Journal of Complexity
11
(1), 1995, pp. 174-193
Achieving the ergodically optimal convergence rate for a one-dimensional minimization problem
Henry P. Wynn
,
Anatoly A. Zhigljavsky
Journal of Complexity
11
(2), 1995, pp. 196-226
Recovering linear operators from inaccurate Data
Bolesƚaw Z. Kacewicz
,
Marek A. Kowalski
Journal of Complexity
11
(2), 1995, pp. 227-239
Average complexity for linear problems in a model with varying information noise
L. Plaskota
Journal of Complexity
11
(2), 1995, pp. 240-264
Computational complexity of fixed points and intersection points
Ker-I Ko
Journal of Complexity
11
(2), 1995, pp. 265-292
An inequality for trigonometric polynomials and its application for estimating the entropy numbers
V.N. Temlyakov
Journal of Complexity
11
(2), 1995, pp. 293-307
Short proofs using compact representations of algebraic integers
Christoph Thiel
Journal of Complexity
11
(3), 1995, pp. 310-329
Binary segmentation for multivariate polynomials
Jürgen Klose
Journal of Complexity
11
(3), 1995, pp. 330-343
A note on testing the resultant
Thomas Lickteig
,
Klaus Meer
Journal of Complexity
11
(3), 1995, pp. 344-351
On the determinant of a uniformly distributed complex matrix
Alan Edelman
Journal of Complexity
11
(3), 1995, pp. 352-357
Computing over the reals with addition and order: Higher complexity classes
Felipe Cucker
,
Pascal Koiran
Journal of Complexity
11
(3), 1995, pp. 358-376
Finding well-conditioned similarities to block-diagonalize nonsymmetric matrices is
NP
-hard
Ming Gu
Journal of Complexity
11
(3), 1995, pp. 377-391
The optimal error of Monte Carlo integration
Peter Mathé
Journal of Complexity
11
(4), 1995, pp. 394-415
Complexity of local solution of multivariate integral equations
Karin Frank
Journal of Complexity
11
(4), 1995, pp. 416-434
Complexities of winning strategies in diophantine games
J.P. Jones
,
A.S. Fraenkel
Journal of Complexity
11
(4), 1995, pp. 435-455
The fine structure of the
n
-widths of
H^p
-spaces in
L_q(-1,1)
Klaus Wilderotter
Journal of Complexity
11
(4), 1995, pp. 456-460
Average widths of
W^r H^\omega
in
C(R)
Fang Gensun
Journal of Complexity
11
(4), 1995, pp. 461-473
Ismagilov type theorems for linear, Gel'fand and Bernstein
n
-widths
K.Yu. Osipenko
,
O.G. Parfenov
Journal of Complexity
11
(4), 1995, pp. 474-492
What is the complexity of solution-restricted operator equations?
Arthur G. Werschulz
Journal of Complexity
11
(4), 1995, pp. 493-514