1 | -- | 51 | Johan Håstad, Sangxia Huang, Rajsekar Manokaran, Ryan O'Donnell, John Wright. Improved NP-Inapproximability for 2-Variable Linear Equations |
1 | -- | 47 | Yury Makarychev, Amir Nayyeri, Anastasios Sidiropoulos. A Pseudo-Approximation for the Genus of Hamiltonian Graphs |
1 | -- | 18 | Justin Gilmer, Michal Koucký, Michael E. Saks. A Communication Game Related to the Sensitivity Conjecture |
1 | -- | 15 | Joshua A. Grochow. Monotone Projection Lower Bounds from Extended Formulation Lower Bounds |
1 | -- | 22 | Cody D. Murray, R. Ryan Williams. On the (Non) NP-Hardness of Computing Circuit Complexity |
1 | -- | 31 | Maria-Florina Balcan, Mark Braverman. Nash Equilibria in Perturbation-Stable Games |
1 | -- | 3 | Prahladh Harsha. Special Issue: CCC 2016: Guest Editor's Foreword |
1 | -- | 25 | F. Bruce Shepherd, Adrian R. Vetta. The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems |
1 | -- | 21 | Rohit Gurjar, Arpita Korwar, Nitin Saxena. Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs |
1 | -- | 17 | David Felber, Rafail Ostrovsky. A Randomized Online Quantile Summary in O((1/ε) log(1/ε)) Words |
1 | -- | 23 | Chin Ho Lee, Emanuele Viola. Some Limitations of the Sum of Small-Bias Distributions |
1 | -- | 41 | David G. Harris, Aravind Srinivasan. A Constructive Lovász Local Lemma for Permutations |
1 | -- | 24 | Venkatesan Guruswami, Euiwoong Lee. Towards a Characterization of Approximation Resistance for Symmetric CSPs |
1 | -- | 38 | John Y. Kim, Swastik Kopparty. Decoding Reed-Muller Codes over Product Sets |
1 | -- | 50 | Thomas Steinke, Salil P. Vadhan, Andrew Wan. Pseudorandomness and Fourier-Growth Bounds for Width-3 Branching Programs |
1 | -- | 33 | Mrinal Kumar 0001, Shubhangi Saraf. Arithmetic Circuits with Locally Low Algebraic Rank |
1 | -- | 22 | Amin Coja-Oghlan, Oliver Cooley, Mihyun Kang, Kathrin Skubch. The Minimum Bisection in the Planted Bisection Model |
1 | -- | 36 | Zeev Dvir, Shubhangi Saraf, Avi Wigderson. Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the Reals |
1 | -- | 19 | Johan Håstad, Rajsekar Manokaran. On the Hardness of Approximating Balanced Homogenous 3-Lin |
1 | -- | 24 | Jop Briët, Oded Regev 0001, Rishi Saket. Tight Hardness of the Non-Commutative Grothendieck Problem |
1 | -- | 34 | Hervé Fournier, Nutan Limaye, Meena Mahajan, Srikanth Srinivasan 0001. The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials |