We prove that the deterministic communication complexity of solving m independent instances of the universal relation is at least m · (n − O( ...
確定! 回上一頁