Login / Signup
On the Hardness of Approximating the k-Way Hypergraph Cut problem.
Chandra Chekuri
Shi Li
Published in:
Theory Comput. (2020)
Keyphrases
</>
vertex set
np hard
higher order
phase transition
pairwise
learning theory
computational complexity
worst case
np complete
hypergraph model
database
databases
machine learning
social networks
mutual information