The Computational Hardness of Finding Large Independent Sets in Sparse Random Hypergraphs

There is a statistical-computational gap of a multiplicative factor of r^(-1/(r-1)) in the density of the largest independent set that can be found by low-degree polynomial algorithms in sparse random r-uniform hypergraphs and r-partite hypergraphs.