Yican Sun
Yican Sun
Home
Publications
Light
Dark
Automatic
Parameterized Inapproximability Hypothesis under ETH
Venkatesan Guruswami
,
Bingkai Lin
,
Xuandi Ren
,
Yican Sun
,
Kewen Wu
March 2024
PDF
Type
Conference paper
Publication
The 56th Annual ACM Symposium on Theory of Computing (STOC'24, Best Paper Award)
Related
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH
Improved Hardness of Approximating k-Clique under ETH
Constant Approximating Parameterized k-SetCover is W[2]-hard
On Lower Bounds of Approximating Parameterized k-Clique
Synthesizing Efficient Memoization Algorithms
Cite
×