Abstract is missing.
- Improved Direct Product Theorems for Randomized Query ComplexityAndrew Drucker. 1-11 [doi]
- Making Branching Programs Oblivious Requires Superlogarithmic OverheadPaul Beame, Widad Machmouchi. 12-22 [doi]
- Hardness of Max-2Lin and Max-3Lin over Integers, Reals, and Large Cyclic GroupsRyan O Donnell, Yi Wu, Yuan Zhou. 23-33 [doi]
- Lower Bounds on Query Complexity for Testing Bounded-Degree CSPsYuichi Yoshida. 34-44 [doi]
- Non-negatively Weighted #CSP: An Effective Complexity DichotomyJin-yi Cai, Xi Chen 0001, Pinyan Lu. 45-54 [doi]
- Symmetric LDPC Codes are not Necessarily Locally TestableEli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan. 55-65 [doi]
- Towards Lower Bounds on Locally Testable Codes via Density ArgumentsEli Ben-Sasson, Michael Viderman. 66-76 [doi]
- Noisy Interpolation of Sparse Polynomials, and ApplicationsShubhangi Saraf, Sergey Yekhanin. 86-92 [doi]
- Paris-Harrington TautologiesLorenzo Carlucci, Nicola Galesi, Massimo Lauria. 93-103 [doi]
- Relativized Separations of Worst-Case and Average-Case Complexities for NPRussell Impagliazzo. 104-114 [doi]
- Non-uniform ACC Circuit Lower BoundsRyan Williams. 115-125 [doi]
- Improved Constructions of Three Source ExtractorsXin Li. 126-136 [doi]
- A New Approach to Affine Extractors and DispersersXin Li. 137-147 [doi]
- Near-Optimal and Explicit Bell Inequality ViolationsHarry Buhrman, Oded Regev, Giannicola Scarpa, Ronald de Wolf. 157-166 [doi]
- Symmetry-Assisted Adversaries for Quantum State GenerationAndris Ambainis, Loïck Magnin, Martin Roetteler, Jérémie Roland. 167-177 [doi]
- Approximation Algorithms for QMA-Complete ProblemsSevag Gharibian, Julia Kempe. 178-188 [doi]
- On the Minimal Fourier Degree of Symmetric Boolean FunctionsAmir Shpilka, Avishay Tal. 200-209 [doi]
- Property Testing Lower Bounds via Communication ComplexityEric Blais, Joshua Brody, Kevin Matulef. 210-220 [doi]
- Pseudorandomness for Permutation and Regular Branching ProgramsAnindya De. 221-231 [doi]
- Pseudorandom Generators for Combinatorial CheckerboardsThomas Watson. 232-242 [doi]
- Bounded-Depth Circuits Cannot Sample Good CodesShachar Lovett, Emanuele Viola. 243-251 [doi]
- k-Independent Gaussians Fool Polynomial Threshold FunctionsDaniel M. Kane. 252-261 [doi]
- Explicit Dimension Reduction and Its ApplicationsZohar Shay Karnin, Yuval Rabani, Amir Shpilka. 262-272 [doi]
- Derandomizing Polynomial Identity Testing for Multilinear Constant-Read FormulaeMatthew Anderson, Dieter van Melkebeek, Ilya Volkovich. 273-282 [doi]
- Tensor Rank: Some Lower and Upper BoundsBoris Alexeev, Michael A. Forbes, Jacob Tsimerman. 283-291 [doi]
- On the Sum of Square Roots of Polynomials and Related ProblemsNeeraj Kayal, Chandan Saha. 292-299 [doi]
- Linear Systems over Finite Abelian GroupsArkadev Chattopadhyay, Shachar Lovett. 300-308 [doi]