HARDNESS OF COLORING 2-COLORABLE 12-UNIFORM HYPERGRAPHS WITH 2(log n)Ω(1) COLORS

被引：4
|
作者：
Khot, Subhash [1 ]
Saket, Rishi [2 ]
机构：
[1] NYU, Dept Comp Sci, New York, NY 10003 USA
[2] IBM Res, Bangalore, Karnataka, India
来源：
SIAM JOURNAL ON COMPUTING | 2017年 / 46卷 / 01期
关键词：
inapproximability; hypergraph; coloring; PCP;
D O I：
10.1137/15100240X
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that it is quasi-NP-hard to color 2-colorable 12-uniform hypergraphs with 2((log n)Omega(1)) colors where n is the number of vertices. Previously, Guruswami Harsha, Hastad, Srinivasan, and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2(2 Omega(root log log n)) colors. Their result is obtained by composing a standard outer probabilistically checkable proof (PCP) with an inner PCP based on the short code of superconstant degree. Our result is instead obtained by composing a new outer PCP with an inner PCP based on the short code of degree two.
引用
收藏
页码：235 / 271
页数：37
相关论文
共 50 条
  • [1] Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2(log n)Ω(1) Colors
    Khot, Subhash
    Saket, Rishi
    [J]. 2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, : 206 - 215
  • [2] Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs
    Saket, Rishi
    [J]. 2014 IEEE 29TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC), 2014, : 78 - 89
  • [3] Hardness results for coloring 3-colorable 3-uniform hypergraphs
    Khot, S
    [J]. FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 23 - 32
  • [4] WIRING IN UNIFORM GRIDS AND 2-COLORABLE MAPS
    TOLLIS, IG
    [J]. INTEGRATION-THE VLSI JOURNAL, 1991, 12 (02) : 189 - 210
  • [5] On the construction of non-2-colorable uniform hypergraphs
    Mathews, Jithin
    Panda, Manas Kumar
    Shannigrahi, Saswata
    [J]. DISCRETE APPLIED MATHEMATICS, 2015, 180 : 181 - 187
  • [6] An expected polynomial time algorithm for coloring 2-colorable 3-graphs
    Person, Yury
    Schacht, Mathias
    [J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2011, 13 (02): : 1 - 18
  • [7] EVERY 8-UNIFORM 8-REGULAR HYPERGRAPH IS 2-COLORABLE
    ALON, N
    BREGMAN, Z
    [J]. GRAPHS AND COMBINATORICS, 1988, 4 (04) : 303 - 305
  • [8] Streaming Algorithms for 2-Coloring Uniform Hypergraphs
    Radhakrishnan, Jaikumar
    Shannigrahi, Saswata
    [J]. ALGORITHMS AND DATA STRUCTURES, 2011, 6844 : 667 - 678
  • [9] Coloring 3-colorable graphs with o(n1/5) colors
    Kawarabayashi, Ken-ichi
    Thorup, Mikkel
    [J]. 31ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2014), 2014, 25 : 458 - 469
  • [10] Coloring 3-Colorable Graphs with Less than n1/5 Colors
    Kawarabayashi, Ken-Ichi
    Thorup, Mikkel
    [J]. JOURNAL OF THE ACM, 2017, 64 (01)
12345