Rishi Saket. Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs. In IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014. pages 78-89, IEEE, 2014. [doi]
@inproceedings{Saket14,
title = {Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs},
author = {Rishi Saket},
year = {2014},
doi = {10.1109/CCC.2014.16},
url = {http://dx.doi.org/10.1109/CCC.2014.16},
researchr = {https://researchr.org/publication/Saket14},
cites = {0},
citedby = {0},
pages = {78-89},
booktitle = {IEEE 29th Conference on Computational Complexity, CCC 2014, Vancouver, BC, Canada, June 11-13, 2014},
publisher = {IEEE},
}