No. Title Author Year
1 Can You Solve Closest String Faster Than Exhaustive Search? Abboud, Amir et al. 2023
2 On Complexity of 1-Center in Various Metrics Abboud, Amir et al. 2023
3 Almost Polynomial Factor Inapproximability for Parameterized k-Clique Karthik C. S. et al. 2022
4 Hardness Amplification of Optimization Problems Goldenberg, Elazar et al. 2020
Current Page :
Number of result pages: 1
Number of documents: 4

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