CCC 2016 Special Issue
|
Vol 17, Article 10 (pp 1-88)
Proof Complexity Lower Bounds from Algebraic Circuit Complexity by Michael A. Forbes, Amir Shpilka, Iddo Tzameret, and Avi Wigderson |
|
Vol 14, Article 9 (pp 1-55)
Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits by Ruiwen Chen, Rahul Santhanam, and Srikanth Srinivasan |
|
Vol 13, Article 21 (pp 1-38)
Decoding Reed–Muller Codes over Product Sets by John Y. Kim and Swastik Kopparty |
|
Vol 13, Article 6 (pp 1-33)
Arithmetic Circuits with Locally Low Algebraic Rank by Mrinal Kumar and Shubhangi Saraf |
|
Vol 13, Article 2 (pp 1-21)
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)
Special Issue: CCC 2016: Guest Editor's Foreword by Prahladh Harsha |