A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest $k$-Subgraph and Other Problems

Julia Chuzhoy, Mina Dalirrooyfard, Vadim Grinberg +1

We propose a new conjecture on hardness of low-degree $2$-CSP's, and show that new hardness of approximation results for Densest $k$-Subgraph and several other problems, including…