Journal of Complexity
Volume 1 6 , Number 1 , March 2000
CONTENTS
Preface 1 REGULAR ARTICLES
Time-Space Tradeoffs in Algebraic Complexity Theory 2 M. Aldaz, J. Heintz, G. Matera, J. L. Montana, and L. M. Pardo Topological Complexity of the Range Searching 50
Dima Grigoriev
A Fast Version of the Schur-Cohn Algorithm 54 Cyril Brunie and Philippe Saux Picart
Deformation Techniques for Efficient Polynomial Equation Solving 70 Joos Heintz, Teresa Krick, Susana Puddu, Juan Sabia, and
Ariel Waissbein
Multivariate Polynomials, Duality, and Structured Matrices 110 Bernard Mourrain and Victor Y. Pan
Fast Computation of Contour Integrals of Rational Functions 181 Peter Kirrinnis
Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree 213 Construction and Improved Newton's Iteration
Victor Y. Pan
Lifting/Descending Processes for Polynomial Zeros 265 Bernard Mourrain and Victor Y. Pan
Continued on inside hack cover
Continued from outside back cover
On Symbolic-Numeric Solving of Sine-Polynomial Equations 274 Aude Maignan
Contraction, Robustness, and Numerical Path-Following Using Secant 286 Maps
Jean-Claude Yakoubsohn
The Complexity of Local Dimensions for Constructible Sets 311 Pascal Koiran
A Note on Non-complete Problems in NP^ 324 S. Ben-David, K. Meer, and C. Michaux
Complexity of Linear Problems with a Fixed Output Basis 333 Erich Novak and Henryk Wozniakowski
On the Time Complexity of Partial Real Functions 363 Armin Hemmerling
