Brief announcement: strongscalingofmatrixmultiplicationalgorithmsandmemory-independent communication lower bounds

Grey Ballard, James Demmel, Olga Holtz, Benjamin Lipshitz, Oded Schwartz · 2012 · arXiv 2005.231202

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

representative citing papers

cs.DC · 2026-06-03 · unverdicted · novelty 7.0

For matrix multiplication ⟨d,n,d⟩ the round complexity is Õ(d^{4/3}); for ⟨n,d,n⟩ it is Θ(d √n) when d ≤ √n and O(d^{2/3} n^{2/3}) when d ≥ √n.

Showing 1 of 1 citing paper.

Rectangular Matrix Multiplication in the Low-Bandwidth Model cs.DC · 2026-06-03 · unverdicted · none · ref 3
For matrix multiplication ⟨d,n,d⟩ the round complexity is Õ(d^{4/3}); for ⟨n,d,n⟩ it is Θ(d √n) when d ≤ √n and O(d^{2/3} n^{2/3}) when d ≥ √n.