Yican Sun
Yican Sun
Home
Publications
Light
Dark
Automatic
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH
Venkatesan Guruswami
,
Bingkai Lin
,
Xuandi Ren
,
Yican Sun
,
Kewen Wu
April 2024
PDF
Type
Preprint
Publication
Preprint
Related
Parameterized Inapproximability Hypothesis 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
×