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=6
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the average complexity of multivariate problems
A. Papageorgiou
,
G.W. Wasilkowski
Journal of Complexity
6
, 1990, pp. 1-23
Selecting relevant projections onto subsets of coordinates: A minimax dependence-based approach
Silviu Guiasu
Journal of Complexity
6
, 1990, pp. 24-40
s
-numbers in information-based complexity
P. Mathé
Journal of Complexity
6
, 1990, pp. 41-66
On learning a union of half spaces
Eric B. Baum
Journal of Complexity
6
, 1990, pp. 67-101
On the design of complex organizations and distributive algorithms
Donald G. Saari
Journal of Complexity
6
, 1990, pp. 102-118
On adaptive and nonadaptive stochastic and deterministic algorithms
Olga R. Chuyan
,
Aleksei G. Sukharev
Journal of Complexity
6
, 1990, pp. 119-127
On the power of neural networks for solving hard problems
Jehoshua Bruck
,
Joseph W. Goodman
Journal of Complexity
6
, 1990, pp. 129-135
On sequential and parallel solution of initial value problems
Boleslaw Z. Kacewicz
Journal of Complexity
6
, 1990, pp. 136-148
On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints
Giulia Galbiati
Journal of Complexity
6
, 1990, pp. 149-165
A note on a theorem of Blum, Shub, and Smale
E. Triesch
Journal of Complexity
6
, 1990, pp. 166-169
Discontinuity detection from band-limited signals
David Lee
Journal of Complexity
6
, 1990, pp. 170-191
Learning from hints in neural networks
Yaser S. Abu-Mostafa
Journal of Complexity
6
, 1990, pp. 192-198
On average case complexity of linear problems with noisy information
L. Plaskota
Journal of Complexity
6
, 1990, pp. 199-230
Probabilistic complexity analysis for linear problems in bounded domains
Stefan Heinrich
Journal of Complexity
6
, 1990, pp. 231-255
Computations over
Z
and
R
: A comparison
Klaus Meer
Journal of Complexity
6
, 1990, pp. 256-263
The complexity of a simple stochastic OR-tree model in which ``directional search'' is bad
Ingo Althöfer
Journal of Complexity
6
, 1990, pp. 264-277
Note on quantization for signals with bounded
(r + 1)
st derivative
G.W. Wasilkowski
Journal of Complexity
6
, 1990, pp. 278-289
Minimax quadratic estimation of a quadratic functional
David L. Donoho
,
Michael Nussbaum
Journal of Complexity
6
, 1990, pp. 290-323
Some complexity results in parallel matrix-based signal processing
Adam W. Bojanczyk
Journal of Complexity
6
, 1990, pp. 324-336
Approximation and optimization on the Wiener space
Klaus Ritter
Journal of Complexity
6
, 1990, pp. 337-364
Space and time complexities of balanced sorting on processor arrays
Ferng-Ching Lin
,
Jiann-Cherng Shieh
Journal of Complexity
6
, 1990, pp. 365-378
Computing topological degree using noisy information
Misako Yokoyama
Journal of Complexity
6
, 1990, pp. 379-388
Complexity of multilinear problems in the worst case setting
Tomasz Jackowski
Journal of Complexity
6
, 1990, pp. 389-408
Diffeomorphisms with infinitely many strange attractors
Jean-Marc Gambaudo
,
Charles Tresser
Journal of Complexity
6
, 1990, pp. 409-416
Simple algorithms for approximating all roots of a polynomial with real roots
Michael Ben-Or
,
Prasoon Tiwari
Journal of Complexity
6
, 1990, pp. 417-442