Under the auspices of the Computational Complexity Foundation (CCF)
We show how one can use non-prime-power, composite moduli forcomputing representations of the product of two $n\times n$ matricesusing only $n^{2+o(1)}$ multiplications.
