Journals in DBLP
J. Complexity 2000, volume: 16, number: 1
Felipe Cucker , Thomas Lickteig Preface. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:1- [Journal ] Mikel Aldaz , Joos Heintz , Guillermo Matera , José Luis Montaña , Luis Miguel Pardo Time-Space Tradeoffs in Algebraic Complexity Theory. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:2-49 [Journal ] Dima Grigoriev Topological Complexity of the Range Searching. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:50-53 [Journal ] Cyril Brunie , M. Ph. Saux Picart A Fast Version of the Schur.Cohn Algorithm. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:54-69 [Journal ] Joos Heintz , Teresa Krick , Susana Puddu , Juan Sabia , Ariel Waissbein Deformation Techniques for Efficient Polynomial Equation Solving. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:70-109 [Journal ] Bernard Mourrain , Victor Y. Pan Multivariate Polynomials, Duality, and Structured Matrices. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:110-180 [Journal ] Peter Kirrinnis Fast Computation of Contour Integrals of Rational Functions. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:181-212 [Journal ] Victor Y. Pan Approximating Complex Polynomial Zeros: Modified Weyl's Quadtree Construction and Improved Newton's Iteration. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:213-264 [Journal ] Bernard Mourrain , Victor Y. Pan Lifting/Descending Processes for Polynomial Zeros. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:265-273 [Journal ] Aude Maignan On Symbolic-Numeric Solving of Sine-Polynomial Equations. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:274-285 [Journal ] Jean-Claude Yakoubsohn Contraction, Robustness, and Numerical Path-Following Using Secant Maps. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:286-310 [Journal ] Pascal Koiran The Complexity of Local Dimensions for Constructible Sets. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:311-323 [Journal ] Shai Ben-David , Klaus Meer , Christian Michaux A Note on Non-complete Problems in NPImage. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:324-332 [Journal ] Erich Novak , Henryk Wozniakowski Complexity of Linear Problems with a Fixed Output Basis. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:333-362 [Journal ] Armin Hemmerling On the Time Complexity of Partial Real Functions. [Citation Graph (0, 0)][DBLP ] J. Complexity, 2000, v:16, n:1, pp:363-376 [Journal ]