Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors.

Subhash Khot Rishi Saket

Published in: FOCS (2014)

Keyphrases

color images
color information
np complete
learning theory
np hardness
graph theory
upper bound
phase transition
color space
information systems
color distribution
log files
small number
np hard
computational complexity
multiscale
digital images
case study
real time
linear array