$2^{(\log N)^{1/4-o(1)}}$ Hardness for Hypergraph Coloring.

Published in: CoRR (2015)

Keyphrases

worst case
np hard
higher order
lower bound
pairwise
phase transition
hypergraph model
learning theory
np hardness
computational complexity
information theoretic
high order
term dnf
image segmentation
machine learning
data sets
hypergraph partitioning
vertex set
multi agent
artificial intelligence
data mining