Login / Signup
A New Conjecture on Hardness of 2-CSP's with Implications to Hardness of Densest k-Subgraph and Other Problems.
Julia Chuzhoy
Mina Dalirrooyfard
Vadim Grinberg
Zihan Tan
Published in:
ITCS (2023)
Keyphrases
</>
np complete
np hard
np hardness
computational complexity
phase transition
random instances
constraint satisfaction problems
information theoretic
constraint propagation
graph mining
search space
k means
optimization problems
constraint satisfaction