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=2005
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Analytic residues along algebraic cycles
Carlos A. Berenstein
,
Alekos Vidras
,
Alain Yger
Journal of Complexity
21
(1), 2005, pp. 5-42
Improved algorithms for computing determinants and resultants
Ioannis Z. Emiris
,
Victor Y. Pan
Journal of Complexity
21
(1), 2005, pp. 43-71
Essentially optimal computation of the inverse of generic polynomial matrices
Claude-Pierre Jeannerod
,
Gilles Villard
Journal of Complexity
21
(1), 2005, pp. 72-86
On solving univariate sparse polynomials in logarithmic time
J. Maurice Rojas
,
Yinyu Ye
Journal of Complexity
21
(1), 2005, pp. 87-110
Semialgebraic complexity of functions
Y. Yomdin
Journal of Complexity
21
(1), 2005, pp. 111-148
Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
Josef Dick
,
Friedrich Pillichshammer
Journal of Complexity
21
(2), 2005, pp. 149-195
Quasi-Monte Carlo methods can be efficient for integration over products of spheres
Frances Y. Kuo
,
Ian H. Sloan
Journal of Complexity
21
(2), 2005, pp. 196-210
Information-based nonlinear approximation: An average case setting
Mark Kon
,
Leszek Plaskota
Journal of Complexity
21
(2), 2005, pp. 211-229
Multi-sequences with
d
-perfect property
Xiutao Feng
,
Quanlong Wang
,
Zongduo Dai
Journal of Complexity
21
(2), 2005, pp. 230-242
Fast solvers of integral equations of the second kind: Wavelet methods
Gennadi Vainikko
,
Andi Kivinukk
,
Jüri Lippus
Journal of Complexity
21
(2), 2005, pp. 243-273
Simultaneous greedy approximation in Banach spaces
D. Leviatan
,
V.N. Temlyakov
Journal of Complexity
21
(3), 2005, pp. 275-293
Approximation on anisotropic Besov classes with mixed norms by standard information
Gensun Fang
,
Fred J. Hickernell
,
Huan Li
Journal of Complexity
21
(3), 2005, pp. 294-313
A note on level-2 condition numbers
Dennis Cheung
,
Felipe Cucker
Journal of Complexity
21
(3), 2005, pp. 314-319
A note on E. Thiémard's algorithm to compute bounds for the star discrepancy
Tim Pillards
,
Ronald Cools
Journal of Complexity
21
(3), 2005, pp. 320-323
On the joint linear complexity profile of explicit inversive multisequences
Wilfried Meidl
,
Arne Winterhof
Journal of Complexity
21
(3), 2005, pp. 324-336
Mercer theorem for RKHS on noncompact sets
Hongwei Sun
Journal of Complexity
21
(3), 2005, pp. 337-349
Learning with generalization capability by kernel methods of bounded complexity
Vȇra Kůrková
,
Marcello Sanguineti
Journal of Complexity
21
(3), 2005, pp. 350-367
Generalized polar varieties: Geometry and algorithms
B. Bank
,
M. Giusti
,
J. Heintz
,
L.M. Pardo
Journal of Complexity
21
(4), 2005, pp. 377-412
On the number of multiplications needed to invert a monic power series over fields of characteristic two
Markus Bläser
Journal of Complexity
21
(4), 2005, pp. 413-419
Polynomial evaluation and interpolation on special sets of points
Alin Bostan
,
Éric Schost
Journal of Complexity
21
(4), 2005, pp. 420-446
On the expressiveness and decidability of
o
-minimal hybrid systems
Thomas Brihaye
,
Christian Michaux
Journal of Complexity
21
(4), 2005, pp. 447-478
Generalized Budan-Fourier theorem and virtual roots
Michel Coste
,
Tomás Lajous-Loaeza
,
Henri Lombardi
,
Marie-Françoise Roy
Journal of Complexity
21
(4), 2005, pp. 479-486
Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds
Jean-Pierre Dedieu
,
Dmitry Nowicki
Journal of Complexity
21
(4), 2005, pp. 487-501
Numeric vs. symbolic homotopy algorithms in polynomial system solving: A case study
M. De Leo
,
E. Dratman
,
G. Matera
Journal of Complexity
21
(4), 2005, pp. 502-531
Weak Bézout inequality for
D
-modules
Dima Grigoriev
Journal of Complexity
21
(4), 2005, pp. 532-542
Seiten 1
2
>