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
[1]
Hilfe
Suche: Journal=J. Complexity AND YEAR=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the complexity of exclusion algorithms for optimization
Eugene Allgower
,
Melissa Erdmann
,
Kurt Georg
Journal of Complexity
18
(2), 2002, pp. 573-588
Verifying topological indices for higher-order rank deficiencies
R. Baker Kearfott
,
Jianwei Dian
Journal of Complexity
18
(2), 2002, pp. 589-611
On the complexity of isolating real roots and computing with certainty the topological degree
B. Mourrain
,
M.N. Vrahatis
,
J.C. Yakoubsohn
Journal of Complexity
18
(2), 2002, pp. 612-640
A two-dimensional bisection envelope algorithm for fixed points
Spencer Shellman
,
K. Sikorski
Journal of Complexity
18
(2), 2002, pp. 641-659
What is the complexity of volume calculation?
A.G. Werschulz
,
H. Woźniakowski
Journal of Complexity
18
(2), 2002, pp. 660-678
A constructive approach to strong tractability using quasi-Monte Carlo algorithms
Xiaoqun Wang
Journal of Complexity
18
(3), 2002, pp. 683-701
Complexity of nonlinear two-point boundary-value problems
Bolesƚaw Kacewicz
Journal of Complexity
18
(3), 2002, pp. 702-738
The covering number in learning theory
Ding-Xuan Zhou
Journal of Complexity
18
(3), 2002, pp. 739-767
Support vector machines are universally consistent
Ingo Steinwart
Journal of Complexity
18
(3), 2002, pp. 768-791
Applicability of Smolyak's algorithms to certain Banach spaces of multivariate functions
Youming Li
Journal of Complexity
18
(3), 2002, pp. 792-814
The infinite-dimensional widths and optimal recovery of generalized Besov classes
Liu Yonping
,
Xu Guiqiao
Journal of Complexity
18
(3), 2002, pp. 815-832
Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure
Petra Huhn
,
Karl Heinz Borgwardt
Journal of Complexity
18
(3), 2002, pp. 833-910
Topological complexity of zero finding with algebraic operations
Peter Hertling
Journal of Complexity
18
(4), 2002, pp. 912-942
Component-by-component construction of good lattice rules with a composite number of points
Frances Y. Kuo
,
Stephen Joe
Journal of Complexity
18
(4), 2002, pp. 943-976
An analog characterization of the Grzegorczyk hierarchy
Manuel Lameiras Campagnolo
,
Cristopher Moore
,
José Félix Costa
Journal of Complexity
18
(4), 2002, pp. 977-1000
Kolmogorov width of classes of smooth functions on the sphere
S^{d-1}
Gavin Brown
,
Dai Feng
,
Sun Yong Sheng
Journal of Complexity
18
(4), 2002, pp. 1001-1023
Complete on average Boolean satisfiability
Jie Wang
Journal of Complexity
18
(4), 2002, pp. 1024-1036
Seiten
<
1
2