The SCEAS System
Navigation Menu

Journals in DBLP

J. Complexity
2005, volume: 21, number: 4


  1. Stefan Heinrich wins the 2004 Best Paper Award. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:369-0 [Journal]

  2. Ian Sloan wins the 2005 Information-Based Complexity Prize. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:370-0 [Journal]

  3. 2005 Information-Based Complexity Young Researcher Award Committee. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:371-0 [Journal]
  4. Thomas Lickteig
    Festschrift in honor of Arnold Scho"nhage. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:372-376 [Journal]
  5. Bernd Bank, Marc Giusti, Joos Heintz, Luis Miguel Pardo
    Generalized polar varieties: geometry and algorithms. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:377-412 [Journal]
  6. Markus Bläser
    On the number of multiplications needed to invert a monic power series over fields of characteristic two. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:413-419 [Journal]
  7. Alin Bostan, Éric Schost
    Polynomial evaluation and interpolation on special sets of points. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:420-446 [Journal]
  8. Thomas Brihaye, Christian Michaux
    On the expressiveness and decidability of o-minimal hybrid systems. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:447-478 [Journal]
  9. Michel Coste, Tomás Lajous-Loaeza, Henri Lombardi, Marie-Françoise Roy
    Generalized Budan-Fourier theorem and virtual roots. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:479-486 [Journal]
  10. Jean-Pierre Dedieu, Dmitry Nowicki
    Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:487-501 [Journal]
  11. Mariano De Leo, Ezequiel Dratman, Guillermo Matera
    Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:502-531 [Journal]
  12. Dima Grigoriev
    Weak Bézout inequality for D-modules. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:532-542 [Journal]
  13. Sebastian Heinz
    Complexity of integer quasiconvex polynomial optimization. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:543-556 [Journal]
  14. Armin Hemmerling
    P=NP for some structures over the binary words. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:557-578 [Journal]
  15. Mihai Prunescu
    Two situations with unit-cost: ordered abelian semi-groups and some commutative rings. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:579-592 [Journal]
  16. Andrew J. Sommese, Jan Verschelde, Charles W. Wampler
    An intrinsic homotopy for intersecting algebraic varieties. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:593-608 [Journal]
  17. Arne Storjohann
    The shifted number system for fast linear algebra on integer matrices. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:4, pp:609-650 [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