Combinatorial Boolean Matrix Multiplication in n cubed / 2 omega(sqrt n) Time
cs.DS
Submitted: 2026-11-04
Updated: 2026-11-10
Terminology
Sources
- New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms
- Faster Combinatorial k-Clique Algorithms
- Explicit separations between randomized and deterministic Number-on-Forehead communication
- Strong Bounds for 3-Progressions
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