We show that any bounded integral function $f : A \times B \mapsto \{0,1, \dots, \Delta\}$ with rank $r$ has deterministic communication complexity $\Delta^{O(\Delta)} \cdot \sqrt{r} \cdot \log r$, where the rank of $f$ is defined to be the rank of the $A \times B$ matrix whose entries are the function values. As a corollary, we show that any $n$-dimensional polytope that admits a slack matrix with entries from $\{0,1,\dots,\Delta\}$ has extension complexity at most $\exp(\Delta^{O(\Delta)} \cdot \sqrt{n} \cdot \log n)$.

翻译：我们证明，任意有界整值函数 $f : A \times B \mapsto \{0,1, \dots, \Delta\}$ 若其秩为 $r$，则其确定性通信复杂度为 $\Delta^{O(\Delta)} \cdot \sqrt{r} \cdot \log r$，其中 $f$ 的秩定义为以函数值为元素的 $A \times B$ 矩阵的秩。作为推论，我们证明任意 $n$ 维多面体，若其松弛矩阵的项来自 $\{0,1,\dots,\Delta\}$，则其扩展复杂度至多为 $\exp(\Delta^{O(\Delta)} \cdot \sqrt{n} \cdot \log n)$。