1. Special issue “Conference on Computational Complexity 2004” Guest Editor’s foreword

   • Eric Allender

   Foreword Open access Pages: 89 - 89

2. The complexity of the covering radius problem

   • Venkatesan Guruswami
   • Daniele Micciancio
   • Oded Regev

   Original Paper Open access Pages: 90 - 121

3. Quantum Arthur–Merlin games

   • Chris Marriott
   • John Watrous

   Original Paper Open access Pages: 122 - 152

4. Parameterized complexity of constraint satisfaction problems

   • Dániel Marx

   Original Paper Open access Pages: 153 - 183