Reproduce “The k-Clique hypothesis is dead, for good” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Virginia Vassilevska Williams, Or Zamir
The authors present an algorithm for k-Clique that counts cliques by reorganizing matrix multiplication and folding two vertex-disjoint wedges at once. This turns contributions into simpler weighted graph-counting problems and handles the remainder more cheaply. For every sufficiently large k, it improves the known running-time exponent by a fixed positive amount, even if the matrix-multiplication exponent is 2; the threshold and saving are unspecified.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.