{"_id":{"_str":"534243ba0e946d920a0004d9"},"__v":1,"authorIDs":[],"author_short":["Khot, S.","Saket, R."],"bibbaseid":"khot-saket-hardnessoffindingindependentsetsin2colorableandalmost2colorablehypergraphs-2013","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Subhash"],"propositions":[],"lastnames":["Khot"],"suffixes":[]},{"firstnames":["Rishi"],"propositions":[],"lastnames":["Saket"],"suffixes":[]}],"title":"Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs","journal":"Manuscript","year":"2013","bibtex":"@article{KhotSaket-GHC, \n author = {Subhash Khot and Rishi Saket},\n title = {Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs},\n journal = {Manuscript}, \n year = {2013}\n} \n\n\n","author_short":["Khot, S.","Saket, R."],"key":"KhotSaket-GHC","id":"KhotSaket-GHC","bibbaseid":"khot-saket-hardnessoffindingindependentsetsin2colorableandalmost2colorablehypergraphs-2013","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"people.csail.mit.edu/andyd/CCI_refs.bib","downloads":0,"keywords":[],"search_terms":["hardness","finding","independent","sets","colorable","colorable","hypergraphs","khot","saket"],"title":"Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs","year":2013,"dataSources":["Te9pFfTBkQvusPFGk","6sSgqzaHAPRWvSxTP"]}