Computer Science > Computational Complexity
[Submitted on 6 Apr 2023 (v1), last revised 26 Sep 2023 (this version, v2)]
Title:Improved Hardness of Approximating k-Clique under ETH
View PDFAbstract:In this paper, we prove that assuming the exponential time hypothesis (ETH), there is no $f(k)\cdot n^{k^{o(1/\log\log k)}}$-time algorithm that can decide whether an $n$-vertex graph contains a clique of size $k$ or contains no clique of size $k/2$, and no FPT algorithm can decide whether an input graph has a clique of size $k$ or no clique of size $k/f(k)$, where $f(k)$ is some function in $k^{1-o(1)}$. Our results significantly improve the previous works [Lin21, LRSW22]. The crux of our proof is a framework to construct gap-producing reductions for the $k$-Clique problem. More precisely, we show that given an error-correcting code $C:\Sigma_1^k\to\Sigma_2^{k'}$ that is locally testable and smooth locally decodable in the parallel setting, one can construct a reduction which on input a graph $G$ outputs a graph $G'$ in $(k')^{O(1)}\cdot n^{O(\log|\Sigma_2|/\log|\Sigma_1|)}$ time such that:
$\bullet$ If $G$ has a clique of size $k$, then $G'$ has a clique of size $K$, where $K = (k')^{O(1)}$.
$\bullet$ If $G$ has no clique of size $k$, then $G'$ has no clique of size $(1-\varepsilon)\cdot K$ for some constant $\varepsilon\in(0,1)$.
We then construct such a code with $k'=k^{\Theta(\log\log k)}$ and $|\Sigma_2|=|\Sigma_1|^{k^{0.54}}$, establishing the hardness results above. Our code generalizes the derivative code [WY07] into the case with a super constant order of derivatives.
Submission history
From: Xuandi Ren [view email][v1] Thu, 6 Apr 2023 08:57:44 UTC (99 KB)
[v2] Tue, 26 Sep 2023 04:47:44 UTC (220 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
Connected Papers (What is Connected Papers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.