1. Super-logarithmic depth lower bounds via the direct sum in communication complexity

   • Mauricio Karchmer
   • Ran Raz
   • Avi Wigderson

   OriginalPaper Pages: 191 - 204

2. Fourier analysis for probabilistic communication complexity

   • Ran Raz

   OriginalPaper Pages: 205 - 221

3. How can a complex square root be computed in an optimal way?

   • Thomas Lickteig
   • Kai Werther

   OriginalPaper Pages: 222 - 236

4. On the oracle complexity of factoring integers

   • Ueli M. Maurer

   OriginalPaper Pages: 237 - 247

5. Pseudorandom generators and learning algorithms forAC ⁰

   • Meera Sitharam

   OriginalPaper Pages: 248 - 266

6. Weakly complete problems are not rare

   • David W. Juedes

   OriginalPaper Pages: 267 - 283