Journals in DBLP

Computational Complexity
2001, volume: 10, number: 1

1. Amir Shpilka, Avi Wigderson
   Depth-3 arithmetic circuits over fields of characteristic zero. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2001, v:10, n:1, pp:1-27 [Journal]
   
2. Hana Chockler, Uri Zwick
   Which bases admit non-trivial shrinkage of formulae? [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2001, v:10, n:1, pp:28-40 [Journal]
   
3. Mark Giesbrecht
   Fast computation of the Smith form of a sparse integer matrix. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2001, v:10, n:1, pp:41-69 [Journal]
   
4. Christoph Meinel, Stephan Waack
   The "log rank" conjecture for modular communication complexity. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2001, v:10, n:1, pp:70-91 [Journal]