直接和定理的强化方法
Direct Sum Theorems From Fortification
AI总结:
本文通过推广强化引理得到δ-愚弄集,以双计数论证重证覆盖数直接和定理,并证明协议规模的新直接和定理,改善小规模(如n=2)情形下的下界。
摘要:
我们重新审视通信复杂度中的直接和问题,该问题询问同时解决 n 个通信问题所需的资源是否(近似地)等于分别解决这些问题所需资源的总和。我们的工作始于一个观察:Dinur 和 Meir 的强化引理可以推广为关于集合上子可加测度的一般强化引理。将该引理应用于覆盖数情形,我们得到覆盖数的对偶形式,称为“δ-愚弄集”,它是广义愚弄集。任何包含 δ-愚弄集中足够多元素的矩形都不可能是单色的。利用这一事实,我们能够通过简单的双计数论证重新证明覆盖数的经典直接和定理。形式上,设 S ⊆ (A×B) × O 和 T ⊆ (P×Q) × Z 为两个通信问题,则 log Cov(S×T) ≥ log Cov(S) + log Cov(T) − log log|P||Q| − 4,其中 Cov 表示覆盖数。当前关于通信复杂性的确定性直接和定理的一个问题是,当 n 较小时,特别是 n=2 时,它们不提供任何信息。在这项工作中,我们证明了一个关于协议规模的新直接和定理,该定理在协议规模方面为两个函数提供了更好的直接和结果。形式上,设 L 表示通信问题的协议规模复杂度,给定通信问题 F: A × B → {0,1},则 log L(F×F) ≥ log L(F) + Ω(√log L(F)) − log log|A||B| − 4。我们所有结果均以类似方式获得,使用 δ-愚弄集为直接和问题构造硬核。
英文摘要:
We revisit the direct sum questions in communication complexity which asks whether the resource needed to solve $n$ communication problems together is (approximately) the sum of resources needed to solve these problems separately. Our work starts with the observation that Dinur and Meir's fortification lemma can be generalized to a general fortification lemma for a sub-additive measure over set. By applying this lemma to the case of cover number, we obtain a dual form of cover number, called "$δ$-fooling set" which is a generalized fooling set. Any rectangle which contains enough number of elements from a $δ$-fooling set can not be monochromatic. With this fact, we are able to reprove the classic direct sum theorem of cover number with a simple double counting argument. Formally, let $S \subseteq (A\times B) \times O$ and $T \subseteq (P\times Q) \times Z$ be two communication problems, $ \log \mathsf{Cov}\left(S\times T\right) \geq \log \mathsf{Cov}\left(S\right) + \log\mathsf{Cov}(T) -\log\log|P||Q|-4.$ where $\mathsf{Cov}$ denotes the cover number. One issue of current deterministic direct sum theorems about communication complexity is that they provide no information when $n$ is small, especially when $n=2$. In this work, we prove a new direct sum theorem about protocol size which imply a better direct sum theorem for two functions in terms of protocol size. Formally, let $\mathsf{L}$ denotes complexity of the protocol size of a communication problem, given a communication problem $F:A \times B \rightarrow \{0,1\}$, $ \log\mathsf{L}\left(F\times F\right)\geq \log \mathsf{L}\left(F\right) +Ω\left(\sqrt{\log\mathsf{L}\left(F\right)}\right)-\log\log|A||B| -4$. All our results are obtained in a similar way using the $δ$-fooling set to construct a hardcore for the direct sum problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。