5 citations · 12 across the 9 of their papers we have counts for
1 paper · 1 filter
Alexander A. Sherstov, Andrey A. Storozhenko
We fully determine the communication complexity of approximating matrix rank, over any finite field F. We study the most general version of this problem, where $0\leq r<…