Notes on matrix multiplication in the \(\mathsf {CLIQUE}\)  model. The first algorithm for matrix multiplication in this model is due to Drucker, Kuhn, and Oshman [1]}, who showed a randomized complexity of \(O(n^{\omega -2})\approx O(n^{0.373})\)  rounds with high probability, for semirings. A deterministic \(O(n^{1/3})\) -round algorithm for matrix multiplication over a semiring is given in [2]}.
