A Lower Bound for Sampling Disjoint Sets
Electronic Colloquium on Computational Complexity (ECCC)(2020)
摘要
AbstractSuppose Alice and Bob each start with private randomness and no other input, and they wish to engage in a protocol in which Alice ends up with a set x⊆ [n] and Bob ends up with a set y⊆ [n], such that (x,y) is uniformly distributed over all pairs of disjoint sets. We prove that for some constant β < 1, this requires Ω (n) communication even to get within statistical distance 1− βn of the target distribution. Previously, Ambainis, Schulman, Ta-Shma, Vazirani, and Wigderson (FOCS 1998) proved that Ω (√n) communication is required to get within some constant statistical distance ɛ > 0 of the uniform distribution over all pairs of disjoint sets of size √n.
更多查看译文
关键词
Communication complexity, set disjointness, sampling
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要