Tight hardness of the non-commutative grothendieck problemJop BriëtOded Regevet al.2017Theory of Computing
Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(log n)ω(1) colorsSubhash KhotRishi Saket2017SIAM Journal on Computing
Inapproximability of minimum vertex cover on k-uniform k-partite hypergraphsVenkatesan GuruswamiSushant Sachdevaet al.2015SIAM Journal on Discrete Mathematics