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

   • Peter Bro Miltersen

   OriginalPaper 02 May 2008 Pages: 147 - 148

2. Halfspace Matrices

   • Alexander A. Sherstov

   OriginalPaper 02 May 2008 Pages: 149 - 178

3. Time-Space Tradeoffs for Counting NP Solutions Modulo Integers

   • R. Ryan Williams

   OriginalPaper 02 May 2008 Pages: 179 - 219

4. Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time

   • Marius Zimand

   OriginalPaper 02 May 2008 Pages: 220 - 253

5. Basis Collapse in Holographic Algorithms

   • Jin-Yi Cai
   • Pinyan Lu

   OriginalPaper 02 May 2008 Pages: 254 - 281

6. Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems

   • Richard Cleve
   • William Slofstra
   • Sarvagya Upadhyay

   OriginalPaper 02 May 2008 Pages: 282 - 299

7. Limits on the Hardness of Lattice Problems in ℓ _p Norms

   • Chris Peikert

   OriginalPaper 02 May 2008 Pages: 300 - 351