Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs...

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

Khot, Subhash, Saket, Rishi
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
46
Language:
english
Journal:
SIAM Journal on Computing
DOI:
10.1137/15100240X
Date:
January, 2017
File:
PDF, 434 KB
english, 2017
Conversion to is in progress
Conversion to is failed