The SCEAS System
Navigation Menu

Journals in DBLP

J. Complexity
2000, volume: 16, number: 1

  1. Felipe Cucker, Thomas Lickteig
    Preface. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:1, pp:1- [Journal]
  2. 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]
  3. Dima Grigoriev
    Topological Complexity of the Range Searching. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2000, v:16, n:1, pp:50-53 [Journal]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002