On the complexity of computing Kronecker coefficients Igor PakGreta Panova OriginalPaper 02 September 2015 Pages: 1 - 36
Sparse affine-invariant linear codes are locally testable Eli Ben-SassonNoga Ron-ZewiMadhu Sudan OriginalPaper 29 October 2015 Pages: 37 - 77
Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games Barış AydınlıoğluDieter van Melkebeek OriginalPaper 31 October 2014 Pages: 79 - 118
The Value of Help Bits in Randomized and Average-Case Complexity Salman BeigiOmid EtesamiAmin Gohari OriginalPaper 09 June 2016 Pages: 119 - 145
Information-theoretic approximations of the nonnegative rank Gábor BraunRahul JainSebastian Pokutta OriginalPaper 23 May 2016 Pages: 147 - 197
Multipartite Quantum Correlation and Communication Complexities Rahul JainZhaohui WeiShengyu Zhang OriginalPaper 23 May 2016 Pages: 199 - 228
On the Structure of Boolean Functions with Small Spectral Norm Amir ShpilkaAvishay TalBen lee Volk OriginalPaper 02 September 2015 Pages: 229 - 273
Fourier Concentration from Shrinkage Russell ImpagliazzoValentine Kabanets OriginalPaper 12 May 2016 Pages: 275 - 321