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=13
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polar varieties, real equation solving, and data structures: The hypersurface case
B. Bank
,
M. Giusti
,
J. Heintz
,
G.M. Mbakop
Journal of Complexity
13
(1), 1997, pp. 5-27
On computing a set of points meeting every cell defined by a family of polynomials on a variety
Saugata Basu
,
Richard Pollack
,
Marie-Françoise Roy
Journal of Complexity
13
(1), 1997, pp. 28-37
Simplified lower bounds for polynomials with algebraic coefficients
Walter Baur
Journal of Complexity
13
(1), 1997, pp. 38-41
Rectangular matrix multiplication revisited
Don Coppersmith
Journal of Complexity
13
(1), 1997, pp. 42-49
Nearly sharp complexity bounds for multiprocessor algebraic computations
Dima Grigoriev
Journal of Complexity
13
(1), 1997, pp. 50-64
Elimination of constants from machines over algebraically closed fields
Pascal Koiran
Journal of Complexity
13
(1), 1997, pp. 65-82
Semi-algebraic complexity - Additive complexity of matrix computational tasks
Thomas Lickteig
,
Klaus Meer
Journal of Complexity
13
(1), 1997, pp. 83-107
Newton's iteration for inversion of Cauchy-like and other structured matrices
Victor Y. Pan
,
Ailong Zheng
,
Xiaohan Huang
,
Olen Dias
Journal of Complexity
13
(1), 1997, pp. 108-124
Stably ergodic dynamical systems and partial hyperbolicity
Charles Pugh
,
Michael Shub
Journal of Complexity
13
(1), 1997, pp. 125-179
Decoding of Reed Solomon codes beyond the error-correction bound
Madhu Sudan
Journal of Complexity
13
(1), 1997, pp. 180-193
Computational complexity over the
p
-adic numbers
Michael Maller
,
Jennifer Whitehead
Journal of Complexity
13
(2), 1997, pp. 195-207
The fast generalized Parker-Traub algorithm for inversion of Vandermonde and related matrices
I. Gohberg
,
V. Olshevsky
Journal of Complexity
13
(2), 1997, pp. 208-234
Different quality indexes for lattice rules
Ronald Cools
,
Andrew Reztsov
Journal of Complexity
13
(2), 1997, pp. 235-258
On
NP
-completeness for linear machines
Christine Gass̈ner
Journal of Complexity
13
(2), 1997, pp. 259-271
Computing the topological degree with noisy information
Misako Yokoyama
Journal of Complexity
13
(2), 1997, pp. 272-278
Real data - Integer solution problems within the Blum-Shub-Smale computational model
Valentin E. Brimkov
,
Stefan S. Danchev
Journal of Complexity
13
(2), 1997, pp. 279-300
Some complexity results for polynomial ideals
Ernst W. Mayr
Journal of Complexity
13
(3), 1997, pp. 303-325
Approximability of the ground state problem for certain Ising spin glasses
Alberto Bertoni
,
Paola Campadelli
,
Cristina Gangai
,
Roberto Posenato
Journal of Complexity
13
(3), 1997, pp. 326-339
Recognizing global occurrence of local properties
Yair Caro
,
Raphael Yuster
Journal of Complexity
13
(3), 1997, pp. 340-352
Linear complexity profiles: Hausdorff dimensions for almost perfect profiles and measures for general profiles
Harald Niederreiter
,
Michael Vielhaber
Journal of Complexity
13
(3), 1997, pp. 353-383
Tractability of tensor product linear operators
Erich Novak
,
Ian H. Sloan
,
Henryk Woźniakowski
Journal of Complexity
13
(4), 1997, pp. 387-418
On the randomized error of polynomial methods for eigenvector and eigenvalue estimates
Gianna M. Del Corso
,
Giovanni Manzini
Journal of Complexity
13
(4), 1997, pp. 419-456
The complexity of indefinite elliptic problems with noisy data
Arthur G. Werschulz
Journal of Complexity
13
(4), 1997, pp. 457-479
Polya's charakterization theorem for complex random variables
Nicholas N. Vakhania
Journal of Complexity
13
(4), 1997, pp. 480-488
Nonlinear approximation in finite-dimensional spaces
R.A. DeVore
,
V.N. Temlyakov
Journal of Complexity
13
(4), 1997, pp. 489-508
Seiten 1
2
>