%0 Journal Article %1 journals/corr/Manurangsi17 %A Manurangsi, Pasin %D 2017 %J CoRR %K dblp %T Inapproximability of Maximum Biclique Problems, Minimum $k$-Cut and Densest At-Least-$k$-Subgraph from the Small Set Expansion Hypothesis. %U http://dblp.uni-trier.de/db/journals/corr/corr1705.html#Manurangsi17 %V abs/1705.03581

@article{journals/corr/Manurangsi17, added-at = {2018-08-13T00:00:00.000+0200}, author = {Manurangsi, Pasin}, biburl = {https://www.bibsonomy.org/bibtex/234ee4b798a861c76f75ef876ce33d98c/dblp}, ee = {http://arxiv.org/abs/1705.03581}, interhash = {e23c4f0bb3f9b925aacda479e9814c59}, intrahash = {34ee4b798a861c76f75ef876ce33d98c}, journal = {CoRR}, keywords = {dblp}, timestamp = {2018-08-14T15:01:41.000+0200}, title = {Inapproximability of Maximum Biclique Problems, Minimum $k$-Cut and Densest At-Least-$k$-Subgraph from the Small Set Expansion Hypothesis.}, url = {http://dblp.uni-trier.de/db/journals/corr/corr1705.html#Manurangsi17}, volume = {abs/1705.03581}, year = 2017 }