research
A Fine-Grained Complexity Hypothesis Falls
Truly subquartic algorithms detect or count four-hypercliques in three-uniform hypergraphs, disproving the 3-uniform Hyperclique Hypothesis.
Summary
Truly subquartic algorithms detect or count four-hypercliques in three-uniform hypergraphs, disproving the 3-uniform Hyperclique Hypothesis.
The result extends to faster constant-size hyperclique algorithms and a faster exponential-time Max-3-SAT algorithm. It is a theoretical complexity result, not a general claim that NP-hard problems became easy.
Why it matters
Truly subquartic algorithms detect or count four-hypercliques in three-uniform hypergraphs, disproving the 3-uniform Hyperclique Hypothesis.
Limits and context
- It is a theoretical complexity result, not a general claim that NP-hard problems became easy.
Key claims
Truly subquartic algorithms detect or count four-hypercliques in three-uniform hypergraphs, disproving the 3-uniform Hyperclique Hypothesis.
Qualification: It is a theoretical complexity result, not a general claim that NP-hard problems became easy.
Evidence: source-2026-11-05-019
Sources
- arXiv preprint 2611.06813, original v1arXiv · primary research
Corrections
No corrections have been recorded for this story.