Volume 13 (2017, in progress)
Vol 13, Article 10 (pp 1-19)
On the Hardness of Approximating Balanced Homogenous 3-Lin
by Johan Håstad and Rajsekar Manokaran
Vol 13, Article 9 (pp 1-34)
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
by Hervé Fournier, Nutan Limaye, Meena Mahajan, and Srikanth Srinivasan
Vol 13, Article 8 (pp 1-22) [APRX-RND15 Spec Issue]
The Minimum Bisection in the Planted Bisection Model
by Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, and Kathrin Skubch
Vol 13, Article 7 (pp 1-18)
A Communication Game Related to the Sensitivity Conjecture
by Justin Gilmer, Michal Koucký, and Michael Saks
Vol 13, Article 6 (pp 1-33) [CCC16 Spec Issue]
Arithmetic Circuits with Locally Low Algebraic Rank
by Mrinal Kumar and Shubhangi Saraf
Vol 13, Article 5 (pp 1-47) [APRX-RND13 Spec Issue]
A Pseudo-Approximation for the Genus of Hamiltonian Graphs
by Yury Makarychev, Amir Nayyeri, and Anastasios Sidiropoulos
Vol 13, Article 4 (pp 1-22)
On the (Non) NP-Hardness of Computing Circuit Complexity
by Cody D. Murray and R. Ryan Williams
Vol 13, Article 3 (pp 1-24) [APRX-RND15 Spec Issue]
Towards a Characterization of Approximation Resistance for Symmetric CSPs
by Venkatesan Guruswami and Euiwoong Lee
Vol 13, Article 2 (pp 1-21) [CCC16 Spec Issue]
Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
by Rohit Gurjar, Arpita Korwar, and Nitin Saxena
Vol 13, Article 1 (pp 1-3) [CCC16 Spec Issue]
Special Issue: CCC 2016: Guest Editor's Foreword
by Prahladh Harsha
List of Editors