1 paper
Abhishek Dhawan, Nhi U. Dinh, Eren C. KızıldaÄ +2
We study the algorithmic tractability of finding large independent sets in dense random hypergraphs. In the sparse regime, much of the natural algorithms can be formulated within e…