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=2006
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast component-by-component construction of rank-1 lattice rules with a non-prime number of points
Dirk Nuyens
,
Ronald Cools
Journal of Complexity
22
(1), 2006, pp. 4-28
Optimal approximation of elliptic problems by linear and nonlinear mappings I
Stephan Dahlke
,
Erich Novak
,
Winfried Sickel
Journal of Complexity
22
(1), 2006, pp. 29-49
Optimal algorithms for global optimization in case of unknown Lipschitz constant
Matthias Horn
Journal of Complexity
22
(1), 2006, pp. 50-70
Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions
Ben J. Waterhouse
,
Frances Y. Kuo
,
Ian H. Sloan
Journal of Complexity
22
(1), 2006, pp. 71-101
Approximation by neural networks and learning theory
V. Maiorov
Journal of Complexity
22
(1), 2006, pp. 102-117
On the complexity of parabolic initial-value problems with variable drift
Knut Petras
,
Klaus Ritter
Journal of Complexity
22
(1), 2006, pp. 118-145
Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets
Peter Bürgisser
,
Felipe Cucker
Journal of Complexity
22
(2), 2006, pp. 147-191
Monte Carlo approximation of weakly singular integral operators
Stefan Heinrich
Journal of Complexity
22
(2), 2006, pp. 192-219
The randomized information complexity of elliptic PDE
Stefan Heinrich
Journal of Complexity
22
(2), 2006, pp. 220-249
Computational complexity of diagram satisfaction in Euclidean geometry
Nathaniel Miller
Journal of Complexity
22
(2), 2006, pp. 250-274
Enumeration results on linear complexity profiles and lattice profiles
Wilfried Meidl
Journal of Complexity
22
(2), 2006, pp. 275-286
The
P \neq NP
conjecture in the context of real and complex analysis
Jerzy Mycka
,
José Félix Costa
Journal of Complexity
22
(2), 2006, pp. 287-303
Solving linear programs with finite precision: II. Algorithms
Dennis Cheung
,
Felipe Cucker
Journal of Complexity
22
(3), 2006, pp. 305-335
Improved upper bounds on the star discrepancy of
(t, m, s)
-nets and
(t, s)
-sequences
Peter Kritzer
Journal of Complexity
22
(3), 2006, pp. 336-347
Weighted quadrature formulas and approximation by zonal function networks on the sphere
H.N. Mhaskar
Journal of Complexity
22
(3), 2006, pp. 348-370
The discretized discrepancy principle under general source conditions
Peter Mathé
,
Sergei V. Pereverzev
Journal of Complexity
22
(3), 2006, pp. 371-381
Expansion and linear complexity of the coordinate sequences over Galois rings
Nigang Sun
,
Lei Hu
Journal of Complexity
22
(3), 2006, pp. 382-395
On the complexity of the resolvent representation of some prime differential ideals
Lisi D'Alfonso
,
Gabriela Jeronimo
,
Pablo Solernó
Journal of Complexity
22
(3), 2006, pp. 396-430
Erratum to ''On the expressiveness and decidability of
o
-minimal hybrid systems''
Thomas Brihaye
,
Christian Michaux
Journal of Complexity
22
(3), 2006, pp. 431-434
A central limit theorem and improved error bounds for a hybrid-Monte Carlo sequence with applications in computational finance
Giray Ökten
,
Bruno Tuffin
,
Vadim Burago
Journal of Complexity
22
(4), 2006, pp. 435-458
Optimal approximation of SDE's with additive fractional noise
Andreas Neuenkirch
Journal of Complexity
22
(4), 2006, pp. 459-474
A numerical-symbolic algorithm for computing the multiplicity of a component of an algebraic set
Dan Bates
,
Chris Peterson
,
Andrew J. Sommese
Journal of Complexity
22
(4), 2006, pp. 475-489
The weighted
b
-adic diaphony
Vassil Grozdanov
Journal of Complexity
22
(4), 2006, pp. 490-513
Complexity of initial-value problems for ordinary differential equations of order
k
Marek Szczȩsny
Journal of Complexity
22
(4), 2006, pp. 514-532
Uniqueness of the singular points of vector fields on Riemannian manifolds under the
\gamma
-condition
Jin-hua Wang
,
Chong Li
Journal of Complexity
22
(4), 2006, pp. 533-548
Seiten 1
2
>