Intl. Colloquium on Automata, Languages, and Programming, ICALP 2017


Article Details
Title: Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis
Article URLs:
Alternative Article URLs:
Authors: Pasin Manurangsi
  • University of California - Berkeley
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1540685, 1655215
DBLP Key: conf/icalp/Manurangsi17
Author Comments:

Discuss this paper and its artifacts below