research
∙
11/10/2022
A New Conjecture on Hardness of Low-Degree 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems
We propose a new conjecture on hardness of low-degree 2-CSP's, and show ...
share
research
∙
04/26/2020
How to hide a clique?
In the well known planted clique problem, a clique (or alternatively, an...
research
∙
12/03/2019
