Journals in DBLP

Computational Complexity
2006, volume: 15, number: 1

1. Kiran S. Kedlaya
   Quantum computation of zeta functions of curves. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2006, v:15, n:1, pp:1-19 [Journal]
   
2. Elad Hazan, Shmuel Safra, Oded Schwartz
   On the complexity of approximating k-set packing. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2006, v:15, n:1, pp:20-39 [Journal]
   
3. Jan Kára, Daniel Král
   Free binary decision diagrams for the computation of EAR_n. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2006, v:15, n:1, pp:40-61 [Journal]
   
4. Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
   Circuits on cylinders. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2006, v:15, n:1, pp:62-81 [Journal]
   
5. Richard Beigel, Lance Fortnow, William I. Gasarch
   A tight lower bound for restricted pir protocols. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 2006, v:15, n:1, pp:82-91 [Journal]