Journal: Theory of Computing

Volume 13, Issue 1

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