Deterministic combinatorial Boolean matrix multiplication
The Boolean product records whether an entry in a row and the matching entry in a column are both 1 for at least one position. How fast can a deterministic combinatorial algorithm compute the entire product?
Why it matters and what counts as progress
Why it matters: Boolean products encode two-step reachability. Related reductions connect faster products with faster triangle detection and other graph problems.
What counts as progress: A faster algorithm needs an exact correctness proof and a worst-case bound in a stated model of computation. The same model is needed to compare running times.
How the problem developed
- 2024 · Graph decomposition [5]
Abboud, Fischer, Kelley, Lovett and Meka Gave a deterministic combinatorial algorithm with a superpolylogarithmic saving over cubic time.
Cui, Liu and Woodruff with Gemini 4 Reached the square-root exponent in the saving for Boolean products and triangle detection.
AI contribution
Combinatorial Boolean Matrix Multiplication in Time
Cui, Liu and Woodruff give deterministic combinatorial algorithms that multiply two Boolean matrices or decide if an -vertex graph contains a triangle in time.
Sources
Publication history
Daily emails by default, only when there’s an update.