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

   • Anup Rao

   OriginalPaper 28 April 2012 Pages: 193 - 195

2. Improved direct product theorems for randomized query complexity

   • Andrew Drucker

   OriginalPaper 02 June 2012 Pages: 197 - 244

3. Bounded-Depth Circuits Cannot Sample Good Codes

   • Shachar Lovett
   • Emanuele Viola

   OriginalPaper 30 March 2012 Pages: 245 - 266

4. Towards lower bounds on locally testable codes via density arguments

   • Eli Ben-Sasson
   • Michael Viderman

   OriginalPaper 27 April 2012 Pages: 267 - 309

5. Property Testing Lower Bounds via Communication Complexity

   • Eric Blais
   • Joshua Brody
   • Kevin Matulef

   OriginalPaper 30 May 2012 Pages: 311 - 358