default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Complexity, Volume 16
Volume 16, Number 1, March 2000
- Felipe Cucker, Thomas Lickteig:
Preface. 1 - Mikel Aldaz
, Joos Heintz, Guillermo Matera, José Luis Montaña, Luis Miguel Pardo:
Time-Space Tradeoffs in Algebraic Complexity Theory. 2-49 - Dima Grigoriev:
Topological Complexity of the Range Searching. 50-53 - Cyril Brunie, M. Ph. Saux Picart:
A Fast Version of the Schur.Cohn Algorithm. 54-69 - Joos Heintz, Teresa Krick, Susana Puddu, Juan Sabia, Ariel Waissbein:
Deformation Techniques for Efficient Polynomial Equation Solving. 70-109 - Bernard Mourrain, Victor Y. Pan:
Multivariate Polynomials, Duality, and Structured Matrices. 110-180 - Peter Kirrinnis:
Fast Computation of Contour Integrals of Rational Functions. 181-212 - Victor Y. Pan:
Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration. 213-264 - Bernard Mourrain, Victor Y. Pan:
Lifting/Descending Processes for Polynomial Zeros. 265-273 - Aude Maignan:
On Symbolic-Numeric Solving of Sine-Polynomial Equations. 274-285 - Jean-Claude Yakoubsohn:
Contraction, Robustness, and Numerical Path-Following Using Secant Maps. 286-310 - Pascal Koiran:
The Complexity of Local Dimensions for Constructible Sets. 311-323 - Shai Ben-David, Klaus Meer, Christian Michaux:
A Note on Non-complete Problems in NPImage. 324-332 - Erich Novak, Henryk Wozniakowski:
Complexity of Linear Problems with a Fixed Output Basis. 333-362 - Armin Hemmerling:
On the Time Complexity of Partial Real Functions. 363-376
Volume 16, Number 2, June 2000
- Arthur G. Werschulz:
What Is the Complexity of Stieltjes Integration? 377-389 - Vladimir Bogachev:
Average Approximations and Moments of Measures. 390-410 - Renate Scheidler:
Decision Problems in Quadratic Function Fields of High Genus. 411-423 - Alexander Kushpel:
Optimal Approximation on Sd. 424-458 - Mehran Mesbahi, George P. Papavassilopoulos:
On the Communication Complexity of Lipschitzian Optimization for the Coordinated Model of Computation. 459-473 - Francisco Curbera:
Delayed Curse of Dimension for Gaussian Integration. 474-506 - Frauke Sprengel:
Interpolation of Functions from Besov-type Spaces on Gauß-Chebyshev Grids. 507-523
Volume 16, Number 3, September 2000
- Joseph F. Traub:
From the Editor. 525 - Jean-Pierre Dedieu, Pascal Koiran:
Guest Editors' Preface. 528 - Gregorio Malajovich:
Condition Number Bounds for Problems with Integer Coefficients. 529-551 - J. Maurice Rojas:
Some Speed-Ups and Speed Limits for Real Algebraic Geometry. 552-571 - Andrew J. Sommese, Jan Verschelde:
Numerical Homotopies to Compute Generic Points on Positive Dimensional Algebraic Sets. 572-602 - Jean-Claude Yakoubsohn:
Finding a Cluster of Zeros of Univariate Polynomials. 603-638
Volume 16, Number 4, December 2000
- Joseph F. Traub:
From the Editor. 639 - Manuel Lameiras Campagnolo, Cristopher Moore, José Félix Costa:
Iteration, Inequalities, and Differentiability in Analog Computers. 642-660 - Chaoping Xing:
Multi-sequences with Almost Perfect Linear Complexity Profile and Function Fields over Finite Fields. 661-675 - Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng:
Weakly Computable Real Numbers. 676-690 - D. Boularas:
Computation of Affine Covariants of Quadratic Bivariate Differential Systems. 691-715 - Fabrice Rouillier, Marie-Françoise Roy, Mohab Safey El Din:
Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation. 716-750
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
