Finding Hypercliques Faster Than Brute Force
cs.DS, cs.CC
Submitted: 2026-11-03
Updated: 2026-11-03
Code: https://github.com/anthropics/formal-math
Terminology
Sources
- Partition Rank and Algebraic Circuit Lower Bounds
- Current Algorithms for Detecting Subgraphs of Bounded Treewidth are Probably Optimal
- Classifying Identities: Subcubic Distributivity Checking and Hardness from Arithmetic Progression Detection
- Beyond 3SUM-Hardness for Geometric Problems
- Subquadratic Approximation Algorithms for Separating Two Points with Objects in the Plane
- Tight Hardness for Shortest Cycles and Paths in Sparse Graphs
- Lower Bounds for Conjunctive Query Evaluation
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