{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:16:26Z","timestamp":1730222186896,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/focs.2014.30","type":"proceedings-article","created":{"date-parts":[[2014,12,30]],"date-time":"2014-12-30T21:46:34Z","timestamp":1419975994000},"page":"206-215","source":"Crossref","is-referenced-by-count":1,"title":["Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors"],"prefix":"10.1109","author":[{"given":"Subhash","family":"Khot","sequence":"first","affiliation":[]},{"given":"Rishi","family":"Saket","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181879"},{"key":"35","article-title":"A note on reducing uniformity in Khot-Saket hypergraph coloring hardness reductions","author":"varma","year":"2014","journal-title":"CoRR"},{"key":"17","article-title":"Vertex cover on 4-regular hyper-graphs is hard to approximate within 2-?","author":"holmerin","year":"2002","journal-title":"Proc CCC"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-003-0025-0"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0032-4"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502098"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61422-2_119"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.54"},{"key":"16","first-page":"458","article-title":"Coloring 3-colorable graphs with o(n1\/5) colors","author":"kawarabayashi","year":"2014","journal-title":"Proc STACS"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1173"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61310-2_26"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959936"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1137\/07068062X"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2014.16"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.117"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700377165"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/509961.509962"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.84"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.75"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488665"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2013.29"},{"key":"28","first-page":"51","article-title":"Hardness of coloring 2-colorable 12-uniform hypergraphs with 2(log n)?(1) colors","volume":"21","author":"khot","year":"2014","journal-title":"ECC"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.83"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/176584.176586"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/2157.2158"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40328-6_17"},{"key":"1","first-page":"614","article-title":"Super-polylogarithmic hypergraph coloring hardness via low-degree long codes","author":"guruswami","year":"2014","journal-title":"Proc STOC"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.44"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.16"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132548"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796302531"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(96)00190-1"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1472"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/274787.274791"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480100376794"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070013"}],"event":{"name":"2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS)","start":{"date-parts":[[2014,10,18]]},"location":"Philadelphia, PA, USA","end":{"date-parts":[[2014,10,21]]}},"container-title":["2014 IEEE 55th Annual Symposium on Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6975722\/6978973\/06979005.pdf?arnumber=6979005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T15:14:11Z","timestamp":1602688451000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6979005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/focs.2014.30","relation":{},"subject":[],"published":{"date-parts":[[2014,10]]}}}