Journals in DBLP

Computational Complexity
2005, volume: 14, number: 1

1. Ran Raz, Amir Shpilka
   Deterministic polynomial identity testing in non-commutative models. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2005, v:14, n:1, pp:1-19 [Journal]
   
2. Dima Grigoriev, Dmitrii V. Pasechnik
   Polynomial-time computing over quadratic maps i: sampling in real algebraic sets. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2005, v:14, n:1, pp:20-52 [Journal]
   
3. Saugata Basu, Richard Pollack, Marie-Françoise Roy
   Computing the euler-poincaré characteristics of sign conditions. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2005, v:14, n:1, pp:53-71 [Journal]
   
4. Lars Kristiansen
   Neat function algebraic characterizations of logspace and linspace. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2005, v:14, n:1, pp:72-88 [Journal]