1. Special issue “Conference on Computational Complexity 2014” Guest Editor’s Foreword

   • Michael E. Saks

   EditorialNotes 17 April 2015 Pages: 197 - 199

2. A parallel repetition theorem for entangled projection games

   • Irit Dinur
   • David Steurer
   • Thomas Vidick

   OriginalPaper 19 May 2015 Pages: 201 - 254

3. Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound

   • Aleksandrs Belovs

   OriginalPaper 17 April 2015 Pages: 255 - 293

4. Equivalence of Polynomial Identity Testing and Polynomial Factorization

   • Swastik Kopparty
   • Shubhangi Saraf
   • Amir Shpilka

   OriginalPaper 17 April 2015 Pages: 295 - 331

5. Mining Circuit Lower Bound Proofs for Meta-Algorithms

   • Ruiwen Chen
   • Valentine Kabanets
   • David Zuckerman

   OriginalPaper 21 April 2015 Pages: 333 - 392

6. Unifying Known Lower Bounds via Geometric Complexity Theory

   • Joshua A. Grochow

   OriginalPaper Open access 07 May 2015 Pages: 393 - 475