1. Special Issue “Conference on Computational Complexity 2013” Guest editor’s foreword

   • Christopher Umans

   EditorialNotes 08 May 2014 Pages: 147 - 149

2. The correct exponent for the Gotsman–Linial Conjecture

   • Daniel M. Kane

   OriginalPaper 13 May 2014 Pages: 151 - 175

3. On Uniformity and Circuit Lower Bounds

   • Rahul Santhanam
   • Ryan Williams

   OriginalPaper 16 May 2014 Pages: 177 - 205

4. Random arithmetic formulas can be reconstructed efficiently

   • Ankit Gupta
   • Neeraj Kayal
   • Youming Qiao

   OriginalPaper 24 May 2014 Pages: 207 - 303

5. How Low can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?

   • Andris Ambainis
   • Ronald de Wolf

   OriginalPaper 09 May 2014 Pages: 305 - 322

6. On the Power of Non-adaptive Learning Graphs

   • Aleksandrs Belovs
   • Ansis Rosmanis

   OriginalPaper 13 May 2014 Pages: 323 - 354