| 215 | -- | 217 | Boaz Barak, Irit Dinur. Special Issue "Conference on Computational Complexity 2012" Guest editors' foreword |
| 219 | -- | 243 | Noga Alon, Amir Shpilka, Christopher Umans. On sunflowers and matrix multiplication |
| 245 | -- | 274 | Kazuhisa Seto, Suguru Tamaki. A satisfiability algorithm and average-case hardness for formulas over the full binary basis |
| 275 | -- | 310 | Parikshit Gopalan, Raghu Meka, Omer Reingold. DNF sparsification and a faster deterministic counting algorithm |
| 311 | -- | 343 | Richard J. Lipton, Ryan Williams. Amplifying circuit lower bounds against polynomial time, with applications |
| 345 | -- | 383 | Holger Dell, Valentine Kabanets, Dieter van Melkebeek, Osamu Watanabe. Is Valiant-Vazirani's isolation probability improvable? |
| 385 | -- | 428 | Gus Gutoski, Xiaodi Wu. Parallel Approximation of Min-Max Problems |
| 429 | -- | 462 | Troy Lee, Jérémie Roland. A strong direct product theorem for quantum query complexity |