Journals in DBLP

Computational Complexity
2008, volume: 17, number: 4

1. 
   Dimension Characterizations of Complexity Classes. [Citation Graph (, )][DBLP]
   
   
2. 
   Hardness Amplification via Space-Efficient Direct Products. [Citation Graph (, )][DBLP]
   
   
3. 
   2-Local Random Reductions to 3-Valued Functions. [Citation Graph (, )][DBLP]
   
   
4. 
   Balancing Syntactically Multilinear Arithmetic Circuits. [Citation Graph (, )][DBLP]
   
   
5. 
   Probabilistic Communication Complexity Over The Reals. [Citation Graph (, )][DBLP]
   
   
6. 
   Every 2-csp Allows Nontrivial Approximation. [Citation Graph (, )][DBLP]