The Hyperclique Hypothesis is False
cs.DS
Submitted: 2026-11-02
Updated: 2026-11-02
Code: https://github.com/anthropics/formal-math
Terminology
Sources
- Partition Rank and Algebraic Circuit Lower Bounds
- Beyond 3SUM-Hardness for Geometric Problems
- Conditionally Tight Algorithms for Maximum k-Coverage and Partial k-Dominating Set via Arity-Reducing Hypercuts
- Counting the dimension of splines of mixed smoothness: A general recipe, and its application to meshes of arbitrary topologies
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time