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=10
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Is it possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers
James Renegar
Journal of Complexity
10
(1), 1994, pp. 1-56
Bounds on the number of units for computing arbitrary dichotomies by multilayer perceptrons
Michel Cosnard
,
Pascal Koiran
,
Hélène Paugam-Moisy
Journal of Complexity
10
(1), 1994, pp. 57-63
Parallel speed-up of Monte Carlo methods for global optimization
R. Shonkwiler
,
Erik van Vleck
Journal of Complexity
10
(1), 1994, pp. 64-95
Tractability and strong tractability of linear multivariate problems
H. Woźniakowski
Journal of Complexity
10
(1), 1994, pp. 96-128
Average saving effects in enumerative methods for solving knapsack problems
Karl Heinz Borgwardt
,
Jürgen Brzank
Journal of Complexity
10
(1), 1994, pp. 129-141
A multi-step algorithm for Hankel matrices
Adam W. Bojanczyk
,
Georg Heinig
Journal of Complexity
10
(1), 1994, pp. 142-164
Learning from hints
Yaser S. Abu-Mostafa
Journal of Complexity
10
(1), 1994, pp. 165-178
One-way communication complexity of computing a collection of rational functions
Zhi-Quan Luo
Journal of Complexity
10
(2), 1994, pp. 179-198
Efficient hybrid algorithms for finding zeros of convex functions
Florian A. Potra
Journal of Complexity
10
(2), 1994, pp. 199-215
Utilizing shelve slots: Sufficiency conditions for some easy instances of hard problems
Moshe Dror
,
Benjamin T. Smith
,
Martin Trudeau
Journal of Complexity
10
(2), 1994, pp. 216-229
General spacefilling curve heuristics and limit theory for traveling salesman problem
Jun Gao
,
J. Michael Steele
Journal of Complexity
10
(2), 1994, pp. 230-245
Modeling optimal effective bandwidth of page-mode memory for stream-oriented computations
Steven A. Moyer
,
Wm.A. Wulf
Journal of Complexity
10
(2), 1994, pp. 246-264
Optimization of active algorithms for recovery of monotonic functions from Hölder's class
Nikolaj P. Korneichuk
Journal of Complexity
10
(2), 1994, pp. 265-269
Combining binary search and Newton's method to compute real roots for a class of real functions
Yinyu Ye
Journal of Complexity
10
(3), 1994, pp. 271-280
The complexity and effectiveness of prediction algorithms
Boris Ya. Ryabko
Journal of Complexity
10
(3), 1994, pp. 281-295
Asymptotic behavior of automatic quadrature
Paola Favati
,
Grazia Lotti
,
Gaspare di Marco
,
Francesco Romani
Journal of Complexity
10
(3), 1994, pp. 296-340
On boundary value problems for the hyperbolic case
Nikholas N. Vakhania
Journal of Complexity
10
(3), 1994, pp. 341-355
On the
\delta \rightarrow 0
limit in probabilistic complexity
Mark A. Kon
Journal of Complexity
10
(3), 1994, pp. 356-365
The complexity of two-point boundary-value problems with piecewise analytic data
Arthur G. Werschulz
Journal of Complexity
10
(4), 1994, pp. 367-383
Probabilistic analysis of Simpson's quadrature
Sung Hee Choi
Journal of Complexity
10
(4), 1994, pp. 384-410
Fast algorithms with preprocessing for matrix-vector multiplication problems
I. Gohberg
,
V. Olshevsky
Journal of Complexity
10
(4), 1994, pp. 411-427
\mu
-average
n
-widths on the Wiener space
Yongsheng Sun
,
Chengyong Wang
Journal of Complexity
10
(4), 1994, pp. 428-436
Positive reducibility of the interior of filled Julia sets
C.T. Chong
Journal of Complexity
10
(4), 1994, pp. 437-444
There exists a problem whose computational complexity is any given function of the information complexity
Ming Chu
Journal of Complexity
10
(4), 1994, pp. 445-450
On parallel complexity of nonsmooth convex optimization
A. Nemirovski
Journal of Complexity
10
(4), 1994, pp. 451-463
Seiten 1
2
>