Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colors

Subhash Khot, Rishi Saket

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We show that it is quasi-NP-hard to color 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colors where n is the number of vertices. Previously, Guruswami et al. [1] showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 22ω &root;log log n) colors. Their result is obtained by composing a standard Outer PCP with an Inner PCP based on the Short Code of super-constant degree. Our result is instead obtained by composing a new Outer PCP with an Inner PCP based on the Short Code of degree two.

Original languageEnglish (US)
Title of host publicationProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
PublisherIEEE Computer Society
Pages206-215
Number of pages10
ISBN (Print)9781479965175
DOIs
StatePublished - Dec 7 2014
Event55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014 - Philadelphia, United States
Duration: Oct 18 2014Oct 21 2014

Other

Other55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014
CountryUnited States
CityPhiladelphia
Period10/18/1410/21/14

Fingerprint

Coloring
Hardness
Color

Keywords

  • Coloring
  • Hypergraph
  • Inapproximability
  • PCP

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Khot, S., & Saket, R. (2014). Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colors. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS (pp. 206-215). [6979005] IEEE Computer Society. https://doi.org/10.1109/FOCS.2014.30

Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colors. / Khot, Subhash; Saket, Rishi.

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society, 2014. p. 206-215 6979005.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Khot, S & Saket, R 2014, Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colors. in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS., 6979005, IEEE Computer Society, pp. 206-215, 55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, United States, 10/18/14. https://doi.org/10.1109/FOCS.2014.30
Khot S, Saket R. Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colors. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society. 2014. p. 206-215. 6979005 https://doi.org/10.1109/FOCS.2014.30
Khot, Subhash ; Saket, Rishi. / Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colors. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society, 2014. pp. 206-215
@inproceedings{25fa8f1ec18d4713a41fcba63d39a3a2,
title = "Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colors",
abstract = "We show that it is quasi-NP-hard to color 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colors where n is the number of vertices. Previously, Guruswami et al. [1] showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 22ω &root;log log n) colors. Their result is obtained by composing a standard Outer PCP with an Inner PCP based on the Short Code of super-constant degree. Our result is instead obtained by composing a new Outer PCP with an Inner PCP based on the Short Code of degree two.",
keywords = "Coloring, Hypergraph, Inapproximability, PCP",
author = "Subhash Khot and Rishi Saket",
year = "2014",
month = "12",
day = "7",
doi = "10.1109/FOCS.2014.30",
language = "English (US)",
isbn = "9781479965175",
pages = "206--215",
booktitle = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colors

AU - Khot, Subhash

AU - Saket, Rishi

PY - 2014/12/7

Y1 - 2014/12/7

N2 - We show that it is quasi-NP-hard to color 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colors where n is the number of vertices. Previously, Guruswami et al. [1] showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 22ω &root;log log n) colors. Their result is obtained by composing a standard Outer PCP with an Inner PCP based on the Short Code of super-constant degree. Our result is instead obtained by composing a new Outer PCP with an Inner PCP based on the Short Code of degree two.

AB - We show that it is quasi-NP-hard to color 2-colorable 12-uniform hypergraphs with 2(logn}ω(1) colors where n is the number of vertices. Previously, Guruswami et al. [1] showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 22ω &root;log log n) colors. Their result is obtained by composing a standard Outer PCP with an Inner PCP based on the Short Code of super-constant degree. Our result is instead obtained by composing a new Outer PCP with an Inner PCP based on the Short Code of degree two.

KW - Coloring

KW - Hypergraph

KW - Inapproximability

KW - PCP

UR - http://www.scopus.com/inward/record.url?scp=84920018842&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84920018842&partnerID=8YFLogxK

U2 - 10.1109/FOCS.2014.30

DO - 10.1109/FOCS.2014.30

M3 - Conference contribution

SN - 9781479965175

SP - 206

EP - 215

BT - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

PB - IEEE Computer Society

ER -