No. Title Author Year
1 ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network Dinur, Irit et al. 2018
2 A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs Manurangsi, Pasin et al. 2017
3 Inapproximability of Maximum Edge Biclique, Maximum Balanced Biclique and Minimum k-Cut from the Small Set Expansion Hypothesis Manurangsi, Pasin 2017
4 Near-Optimal UGC-hardness of Approximating Max k-CSP_R Manurangsi, Pasin et al. 2016
5 Approximating Dense Max 2-CSPs Manurangsi, Pasin et al. 2015
Current Page :
Number of result pages: 1
Number of documents: 5


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI