Journal cover

computational complexity

Volume 24, issue 2, June 2015

CONFERENCE ON COMPUTATIONAL COMPLEXITY 2014

6 articles in this issue

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

Authors
- Michael E. Saks
- Content type: EditorialNotes
- Published: 17 April 2015
- Pages: 197 - 199
A parallel repetition theorem for entangled projection games

Authors
- Irit Dinur
- David Steurer
- Thomas Vidick
- Content type: OriginalPaper
- Published: 19 May 2015
- Pages: 201 - 254
Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound

Authors
- Aleksandrs Belovs
- Content type: OriginalPaper
- Published: 17 April 2015
- Pages: 255 - 293
Equivalence of Polynomial Identity Testing and Polynomial Factorization

Authors
- Swastik Kopparty
- Shubhangi Saraf
- Amir Shpilka
- Content type: OriginalPaper
- Published: 17 April 2015
- Pages: 295 - 331
Mining Circuit Lower Bound Proofs for Meta-Algorithms

Authors (first, second and last of 5)
- Ruiwen Chen
- Valentine Kabanets
- David Zuckerman
- Content type: OriginalPaper
- Published: 21 April 2015
- Pages: 333 - 392
Unifying Known Lower Bounds via Geometric Complexity Theory

Authors
- Joshua A. Grochow
- Content type: OriginalPaper
- Open Access
- Published: 07 May 2015
- Pages: 393 - 475