| 2017 | 32nd Computational Complexity Conference, CCC 2017, Riga, Latvia, July 6-9, 2017 Ryan O'Donnell |
| 2017 | A Note on Amortized Branching Program Complexity. Aaron Potechin |
| 2017 | A Quadratic Lower Bound for Homogeneous Algebraic Branching Programs. Mrinal Kumar |
| 2017 | An Adaptivity Hierarchy Theorem for Property Testing. Clément L. Canonne, Tom Gur |
| 2017 | An Exponential Lower Bound for Homogeneous Depth-5 Circuits over Finite Fields. Mrinal Kumar, Ramprasad Saptharishi |
| 2017 | Augmented Index and Quantum Streaming Algorithms for DYCK(2). Ashwin Nayak, Dave Touchette |
| 2017 | Bounded Independence Plus Noise Fools Products. Elad Haramaty, Chin Ho Lee, Emanuele Viola |
| 2017 | Complete Derandomization of Identity Testing and Reconstruction of Read-Once Formulas. Daniel Minahan, Ilya Volkovich |
| 2017 | Complexity-Theoretic Foundations of Quantum Supremacy Experiments. Scott Aaronson, Lijie Chen |
| 2017 | Conspiracies Between Learning Algorithms, Circuit Lower Bounds, and Pseudorandomness. Igor C. Oliveira, Rahul Santhanam |
| 2017 | Derandomizing Isolation in Space-Bounded Settings. Dieter van Melkebeek, Gautam Prakriya |
| 2017 | Distribution Testing Lower Bounds via Reductions from Communication Complexity. Eric Blais, Clément L. Canonne, Tom Gur |
| 2017 | Easiness Amplification and Uniform Circuit Lower Bounds. Cody D. Murray, R. Ryan Williams |
| 2017 | Exponentially Small Soundness for the Direct Product Z-Test. Irit Dinur, Inbal Livni Navon |
| 2017 | From Weak to Strong LP Gaps for All CSPs. Mrinalkanti Ghosh, Madhur Tulsiani |
| 2017 | Front Matter, Table of Contents, Preface, Awards, Conference Organization, External Reviewers. |
| 2017 | Graph Colouring is Hard for Algorithms Based on Hilbert's Nullstellensatz and Gröbner Bases. Massimo Lauria, Jakob Nordström |
| 2017 | Greedy Strikes Again: A Deterministic PTAS for Commutative Rank of Matrix Spaces. Markus Bläser, Gorav Jindal, Anurag Pandey |
| 2017 | Improved Bounds for Quantified Derandomization of Constant-Depth Circuits and Polynomials. Roei Tell |
| 2017 | Noise Stability Is Computable and Approximately Low-Dimensional. Anindya De, Elchanan Mossel, Joe Neeman |
| 2017 | On Algebraic Branching Programs of Small Width. Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam |
| 2017 | On the Average-Case Complexity of MCSP and Its Variants. Shuichi Hirahara, Rahul Santhanam |
| 2017 | On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz. Aleksandrs Belovs, Gábor Ivanyos, Youming Qiao, Miklos Santha, Siyi Yang |
| 2017 | Optimal Quantum Sample Complexity of Learning Algorithms. Srinivasan Arunachalam, Ronald de Wolf |
| 2017 | PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster. Dominik Scheder, John P. Steinberger |
| 2017 | Query-to-Communication Lifting for P^NP. Mika Göös, Pritish Kamath, Toniann Pitassi, Thomas Watson |
| 2017 | Random Resolution Refutations. Pavel Pudlák, Neil Thapen |
| 2017 | Reconstruction of Full Rank Algebraic Branching Programs. Neeraj Kayal, Vineet Nair, Chandan Saha, Sébastien Tavenas |
| 2017 | Representations of Monotone Boolean Functions by Linear Programs. Mateus de Oliveira Oliveira, Pavel Pudlák |
| 2017 | Separating Quantum Communication and Approximate Rank. Anurag Anshu, Shalev Ben-David, Ankit Garg, Rahul Jain, Robin Kothari, Troy Lee |
| 2017 | Settling the Query Complexity of Non-Adaptive Junta Testing. Xi Chen, Rocco A. Servedio, Li-Yang Tan, Erik Waingarten, Jinyu Xie |
| 2017 | Stochasticity in Algorithmic Statistics for Polynomial Time. Alexey Milovanov, Nikolay K. Vereshchagin |
| 2017 | The Computational Complexity of Integer Programming with Alternations. Danny Nguyen, Igor Pak |
| 2017 | Tight Bounds on the Fourier Spectrum of AC0. Avishay Tal |
| 2017 | Trading Information Complexity for Error. Yuval Dagan, Yuval Filmus, Hamed Hatami, Yaqiao Li |