9 citations · 14 across the 6 of their papers we have counts for
1 paper · 1 filter
Adi Shraibman
We prove upper bounds on deterministic communication complexity in terms of log of the rank and simple versions of the corruption bound. Our bounds are a simplified version of the…