1. Special Issue “Conference on Computational Complexity 2005” Guest Editor’s Foreword

   • Anna Gál

   OriginalPaper Open access Pages: 297 - 297

2. Pseudorandomness for Approximate Counting and Sampling

   • Ronen Shaltiel
   • Christopher Umans

   OriginalPaper Open access Pages: 298 - 341

3. Complexity of Ring Morphism Problems

   • Neeraj Kayal
   • Nitin Saxena

   OriginalPaper Open access Pages: 342 - 390

4. A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness

   • Paul Beame
   • Toniann Pitassi
   • Avi Wigderson

   OriginalPaper Open access Pages: 391 - 432

5. Inductive Time-Space Lower Bounds for Sat and Related Problems

   • Ryan Williams

   OriginalPaper Open access Pages: 433 - 470