Journals in DBLP

Computational Complexity
1995, volume: 5, number: 3/4

1. Mauricio Karchmer, Ran Raz, Avi Wigderson
   Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1995, v:5, n:3/4, pp:191-204 [Journal]
   
2. Ran Raz
   Fourier Analysis for Probabilistic Communication Complexity. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1995, v:5, n:3/4, pp:205-221 [Journal]
   
3. Thomas Lickteig, Kai Werther
   How can a Complex Square Root be Computed in an Optimal Way. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1995, v:5, n:3/4, pp:222-236 [Journal]
   
4. Ueli M. Maurer
   On the Oracle Complexity of Factoring Integers. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1995, v:5, n:3/4, pp:237-247 [Journal]
   
5. Meera Sitharam
   Pseudorandom Generators and Learning Algorithms for AC^0. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1995, v:5, n:3/4, pp:248-266 [Journal]
   
6. David W. Juedes
   Weakly Complete Problems are not Rare. [Citation Graph (0, 0)][DBLP]
   Computational Complexity, 1995, v:5, n:3/4, pp:267-283 [Journal]