DeepAI AI Chat
Log In Sign Up

Direct Sum Theorems From Fortification

by   Hao Wu, et al.
Shanghai Maritime University Education Development Foundation

We revisit the direct sum theorems in communication complexity which askes whether the resource to solve n communication problems together is (approximately) the sum of resources to solve these problems separately. Our work starts with the observation that Meir and Dinur's fortification lemma for protocol size over rectangles 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. Given a communication problem S⊆ (X× Y) × Z, let Λ⊆ X× Y be a δ-fooling set of S, then given any subset Λ̃⊆Λ such that |Λ̃|/|Λ| > δ, there is no monochromatic rectangle that covers the subset Λ̃. Particularly, there is a 16log|X| |Y|/ 𝖢𝗈𝗏(S)-fooling set of communication problem S. With this fact, we are able to reprove the classic direct sum theorem of cover number with a simple double counting argument. And 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 𝖫 denote the protocol szie, given a communication problem F:A × B →{0,1}, log𝖫(F× F)≥log𝖫(F) +Ω(√(log𝖫(F)))-loglog|A||B| -4.We also prove a tight cover number lower bound for the agree problem introduced by Amos Beimel et al.


page 1

page 2

page 3

page 4


Query-to-Communication Lifting Using Low-Discrepancy Gadgets

Lifting theorems are theorems that relate the query complexity of a func...

Representability of the Direct Sum of q-Matroids

q-Matroids are the q-analogue of matroids. In this short note we conside...

A near-optimal direct-sum theorem for communication complexity

We show a near optimal direct-sum theorem for the two-party randomized c...

Tight Bounds on Subexponential Time Approximation of Set Cover and Related Problems

We show that Set Cover on instances with N elements cannot be approximat...

PCP Theorems, SETH and More: Towards Proving Sub-linear Time Inapproximability

In this paper we propose the PCP-like theorem for sub-linear time inappr...

A Strong XOR Lemma for Randomized Query Complexity

We give a strong direct sum theorem for computing xor ∘ g. Specifically,...

Approximating activation edge-cover and facility location problems

What approximation ratio can we achieve for the Facility Location proble...