ACM Symposium on Discrete Algorithms, SODA 2014


Article Details
Title: Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphs
Article URLs:
Alternative Article URLs:
Authors: Subhash Khot
  • New York University, Department of Computer Science
Rishi Saket
  • IBM T. J. Watson Research Center, US
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 0832795
DBLP Key: conf/soda/KhotS14
Author Comments:

Discuss this paper and its artifacts below