As explained earlier, we do not expect a lower bound for matrix multiplication in the \(\mathsf {CLIQUE}\)  model. However, it is shown in [1]} that a near-linear number of rounds is required in the \(\mathsf {BROADCAST~CONGESTED~CLIQUE}\)  model.
