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=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Time-space tradeoffs in algebraic complexity theory
M. Aldaz
,
J. Heintz
,
G. Matera
,
J.L. Montaña
,
L.M. Pardo
Journal of Complexity
16
(1), 2000, pp. 2-49
Topological complexity of the range searching
Dima Grigoriev
Journal of Complexity
16
(1), 2000, pp. 50-53
A fast version of the Schur-Cohn algorithm
Cyril Brunie
,
Philippe Saux Picart
Journal of Complexity
16
(1), 2000, pp. 54-69
Deformation techniques for efficient polynomial equation solving
Joos Heintz
,
Teresa Krick
,
Susana Puddu
,
Juan Sabia
,
Ariel Waissbein
Journal of Complexity
16
(1), 2000, pp. 70-109
Multivariate polynomials, duality, and structured matrices
Bernard Mourrain
,
Victor Y. Pan
Journal of Complexity
16
(1), 2000, pp. 110-180
Fast computation of contour integrals of rational functions
Peter Kirrinnis
Journal of Complexity
16
(1), 2000, pp. 181-212
Approximating complex polynomial zeros: Modified Weyl's quadtree construction and improved Newton's iteration
Victor Y. Pan
Journal of Complexity
16
(1), 2000, pp. 213-264
Lifting/descending processes for polynomial zeros
Bernard Mourrain
,
Victor Y. Pan
Journal of Complexity
16
(1), 2000, pp. 265-273
On symbolic-numeric solving of sine-polynomial equations
Aude Maignan
Journal of Complexity
16
(1), 2000, pp. 274-285
Contraction, robustness, and numerical path-following using secant maps
Jean-Claude Yakoubsohn
Journal of Complexity
16
(1), 2000, pp. 286-310
The complexity of local dimensions for constructible sets
Pascal Koiran
Journal of Complexity
16
(1), 2000, pp. 311-323
A note on non-complete problems in
NP_R
S. Ben-David
,
K. Meer
,
C. Michaux
Journal of Complexity
16
(1), 2000, pp. 324-332
Complexity of linear problems with a fixed output basis
Erich Novak
,
Henryk Woźniakowski
Journal of Complexity
16
(1), 2000, pp. 333-362
On the time complexity of partial real functions
Armin Hemmerling
Journal of Complexity
16
(1), 2000, pp. 363-376
What is the complexity of Stieltjes integration?
Arthur G. Werschulz
Journal of Complexity
16
(2), 2000, pp. 377-389
Average approximations and moments of measures
Vladimir Bogachev
Journal of Complexity
16
(2), 2000, pp. 390-410
Decision problems in quadratic function fields of high genus
R. Scheidler
Journal of Complexity
16
(2), 2000, pp. 411-423
Optimal approximation on
S^d
Alexander Kushpel
Journal of Complexity
16
(2), 2000, pp. 424-458
On the communication complexity of Lipschitzian optimization for the coordinated model of computation
Mehran Mesbahi
,
George P. Papavassilopoulos
Journal of Complexity
16
(2), 2000, pp. 459-473
Delayed curse of dimension for Gaussian integration
Francisco Curbera
Journal of Complexity
16
(2), 2000, pp. 474-506
Interpolation of functions from Besov-type spaces on Gauß-Chebyshev grids
Frauke Sprengel
Journal of Complexity
16
(2), 2000, pp. 507-523
Condition number bounds for problems with integer coefficients
Gregorio Malajovich
Journal of Complexity
16
(3), 2000, pp. 529-551
Some speed-ups and speed limits for real algebraic geometry
J. Maurice Rojas
Journal of Complexity
16
(3), 2000, pp. 552-571
Numerical homotopies to compute generic points on positive dimensional algebraic sets
Andrew J. Sommese
,
Jan Verschelde
Journal of Complexity
16
(3), 2000, pp. 572-602
Finding a cluster of zeros of univariate polynomials
Jean-Claude Yakoubsohn
Journal of Complexity
16
(3), 2000, pp. 603-638
Seiten 1
2
>