Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions.

Published in: Chic. J. Theor. Comput. Sci. (2015)

Keyphrases

np hard
higher order
computational complexity
special case
real time
np hardness
significantly reduced
phase transition
information theoretic
random walk
mobile robot
learning theory
np complete
worst case
k means
pairwise
optimal solution
image processing
e learning