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=1991
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the distance to the zero-set of a polynomial
Matthew A. Grayson
Journal of Complexity
7
, 1991, pp. 97
Solvability of ill-posed problems: An historical note
J.F. Traub
Journal of Complexity
7
, 1991, pp. 219
Discretization effects in statistical inverse problems
Iain M. Johnstone
,
Bernard W. Silverman
Journal of Complexity
7
, 1991, pp. 1-34
Noisy information for linear problems in the asymptotic setting
B.Z. Kacewicz
,
L. Plaskota
Journal of Complexity
7
, 1991, pp. 35-57
Probabilistic analysis of numerical integration algorithms
Feng Gao
Journal of Complexity
7
, 1991, pp. 58-69
Complexity of functions: Some questions, conjectures, and results
Y. Yomdin
Journal of Complexity
7
, 1991, pp. 70-96
Complexity of multilinear problems in the average case setting
Tomasz Jackowski
Journal of Complexity
7
, 1991, pp. 98-120
On optimality of Krylov's information when solving linear operator equations
A.S. Nemirovsky
Journal of Complexity
7
, 1991, pp. 121-130
Condition numbers of random matrices
Stanislaw J. Szarek
Journal of Complexity
7
, 1991, pp. 131-149
Optimal residual algorithms for linear operator equations
Arthur G. Werschulz
Journal of Complexity
7
, 1991, pp. 150-173
A role of lower semicontinuous functions in the combinatorial complexity of geometric problems
Jerzy W. Jaromczyk
,
Grzegorz Świa̧tek
Journal of Complexity
7
, 1991, pp. 174-183
The parallel complexity of function approximation
Jörg-Detlef Kern
Journal of Complexity
7
, 1991, pp. 184-199
NP-completeness of graph decomposition problems
Edith Cohen
,
Michael Tarsi
Journal of Complexity
7
, 1991, pp. 200-212
Linearity of algorithms and a result of Ando
M.A. Kon
,
R. Tempo
Journal of Complexity
7
, 1991, pp. 213-217
On the average case solvability of ill-posed problems
Mark A. Kon
,
Klaus Ritter
,
Arthur G. Werschulz
Journal of Complexity
7
, 1991, pp. 220-224
Gaussian mean boundedness of densely defined linear operators
Nicholas N. Vakhania
Journal of Complexity
7
, 1991, pp. 225-231
A path integral approach to data structure evolution
Robert S. Maier
Journal of Complexity
7
, 1991, pp. 232-260
Random approximation of Sobolev embeddings
Peter Mathé
Journal of Complexity
7
, 1991, pp. 261-281
Matrix inversion in
RNC^1
B. Codenotti
,
M. Leoncini
Journal of Complexity
7
, 1991, pp. 282-295
Random languages for nonuniform complexity classes
Martin Mundhenk
,
Rainer Schuler
Journal of Complexity
7
, 1991, pp. 296-310
Some remarks concerning the complexity of computing class groups of quadratic fields
Johannes A. Buchmann
,
Hugh C. Williams
Journal of Complexity
7
, 1991, pp. 311-315
Programmed interactions in higher-order neural networks: Maximal capacity
Santosh S. Venkatesh
,
Pierre Baldi
Journal of Complexity
7
, 1991, pp. 316-337
Parallel information-based complexity
Stefan Heinrich
,
Jörg-Detlef Kern
Journal of Complexity
7
, 1991, pp. 339-370
Statistical complexity of dominant eigenvector calculation
Eric Kostlan
Journal of Complexity
7
, 1991, pp. 371-379
On the complexity of online computations of real functions
Klaus Weihrauch
Journal of Complexity
7
, 1991, pp. 380-394
Seiten 1
2
>