双向公共硬币通信复杂性的强直积定理
A strong direct product theorem for two-way public coin communication complexity
摘要：
根据我们定义的新复杂性度量，我们展示了所有关系的双向公共币通信复杂性的直接结果。我们的新测度是[J，Klauck and Nayak 08]中的双向乘积子分布界对非乘积分布的推广，从而我们的结果隐含了它们在双向乘积子分布界方面的直接乘积结果.我们证明了我们新的复杂性度量给出了集合不相交问题的紧下界，因此我们重现了这个问题的强直积结果，这是以前由[Klauck 00]证明的。
英文摘要：
We show a direct product result for two-way public coin communication complexity of all relations in terms of a new complexity measure that we define. Our new measure is a generalization to non-product distributions of the two-way product subdistribution bound of [J, Klauck and Nayak 08], thereby our result implying their direct product result in terms of the two-way product subdistribution bound. We show that our new complexity measure gives tight lower bound for the set-disjointness problem, as a result we reproduce strong direct product result for this problem, which was previously shown by [Klauck 00].
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
