跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.24750 · v1

Counting $6$-Cliques in $O(n^{5.97})$ time and $O(\log n)$ space

首次提交 2026-11-19 01:07
版本更新 2026-11-19 01:07
雷达观测 2026-11-19 15:04
arXiv ↗PDF ↗

摘要

We present an algorithm that, given read-only access to the adjacency matrix of an nn-vertex graph GG, computes the number of 66-cliques in GG using O(n5.97)O(n^{5.97}) time and O(log⁡n)O(\log n) space. We achieve this by exploiting a decomposition of an equality indicator function underlying, among others, the refutations of the Exponential Time Hypothesis by OpenAI and Anthropic, and of the kk-Clique Conjecture by Vassilevska Williams and Zamir [arXiv, 2026]. Via known reductions, this implies an O(1.994n)O(1.994^n) time and polynomial space algorithm for Max Cut on nn-vertex graphs.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 01:07 · 最新观测版本

Counting $6$-Cliques in $O(n^{5.97})$ time and $O(\log n)$ space

We present an algorithm that, given read-only access to the adjacency matrix of an nn-vertex graph GG, computes the number of 66-cliques in GG using O(n5.97)O(n^{5.97}) time and O(log⁡n)O(\log n) space. We achieve this by exploiting a decomposition of an equality indicator function underlying, among others, the refutations of the Exponential Time Hypothesis by OpenAI and Anthropic, and of the kk-Clique Conjecture by Vassilevska Williams and Zamir [arXiv, 2026]. Via known reductions, this implies an O(1.994n)O(1.994^n) time and polynomial space algorithm for Max Cut on nn-vertex graphs.

查看此版本解读 →查看此版本原文 ↗