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

   • Johan Håstad

   OriginalPaper 20 May 2010 Pages: 151 - 152

2. Lower Bounds on the Randomized Communication Complexity of Read-Once Functions

   • Nikos Leonardos
   • Michael Saks

   OriginalPaper 17 May 2010 Pages: 153 - 181

3. k-Subgraph Isomorphism on AC⁰ Circuits

   • Kazuyuki Amano

   OriginalPaper 10 May 2010 Pages: 183 - 210

4. A New Characterization of ACC⁰ and Probabilistic CC⁰

   • Kristoffer Arnsfelt Hansen
   • Michal Koucký

   OriginalPaper 07 May 2010 Pages: 211 - 234

5. The Complexity of Boolean Functions in Different Characteristics

   • Parikshit Gopalan
   • Amir Shpilka
   • Shachar Lovett

   OriginalPaper 12 May 2010 Pages: 235 - 263

6. Are PCPs Inherent in Efficient Arguments?

   • Guy N. Rothblum
   • Salil Vadhan

   OriginalPaper 14 May 2010 Pages: 265 - 304

7. Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete

   • Akitoshi Kawamura

   OriginalPaper 07 May 2010 Pages: 305 - 332