In algebraic complexity theory, for each real k≥0, let ω(k) denote the exponent for multiplying an n×nk matrix by an nk×n matrix. We define
α:=sup{k≥0:ω(k)=2}.
Thus α is the largest aspect-ratio exponent for which rectangular matrix multiplication can still be performed in essentially quadratic arithmetic time.
[LGU2018-def-omega] [LGU2018-def-alpha]
We define
C15b:=α.
The current best established range is
0.321334<C15b≤1.
[WXXZ2024-alpha-0321334] [CLLZ2025-ub-1]