← 研踪 PaperTrailarXiv: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
摘要
We present an algorithm that, given read-only access to the adjacency matrix of an -vertex graph , computes the number of -cliques in using time and 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 -Clique Conjecture by Vassilevska Williams and Zamir [arXiv, 2026]. Via known reductions, this implies an time and polynomial space algorithm for Max Cut on -vertex graphs.
观测到的版本
相邻记录可能跳过中间版本;首次发现 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 -vertex graph , computes the number of -cliques in using time and 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 -Clique Conjecture by Vassilevska Williams and Zamir [arXiv, 2026]. Via known reductions, this implies an time and polynomial space algorithm for Max Cut on -vertex graphs.
查看此版本解读 →查看此版本原文 ↗