Login / Signup
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
Zihan Tan
Published in:
CoRR (2022)
Keyphrases
</>
low degree
np complete
np hard
constraint satisfaction problems
agnostic learning
random instances
worst case
constraint satisfaction
phase transition
computational complexity
graph mining
theoretical analysis
information theoretic
learning theory