Searching for "Lower Bounds on the Multiparty Communication Complexity." – sorted by Relevance.
12 documents found, showing 1 through 10.
Next 10 →
-
Hadamard tensors and lower bounds on multiparty communication complexity
- …Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity Jeff Ford and Anna Gál…
- Cited by 6 (0 self) – Add To MetaCart
-
Time-Space Tradeoffs, Multiparty Communication Complexity, and Nearest-Neighbor Problems
- …, 15] in the fixed partition model. The lower bound techniques for multiparty communication complexity…
- Cited by 14 (1 self) – Add To MetaCart
-
The multiparty communication complexity of Exact-T: Improved bounds and new problems
- … lower bounds on the multiparty communication complexity of many regular languages. The 2-party…
- Cited by 2 (1 self) – Add To MetaCart
-
NOF-multiparty information complexity bounds for pointer jumping
- … lower bound on the communication complexity of pointer jumping for multiparty one-way protocols…
- Cited by 2 (0 self) – Add To MetaCart
-
Communication lower bounds using dual polynomials
- …Communication Lower Bounds Using Dual Polynomials ∗ Alexander A. Sherstov Univ. of Texas at Austin…
- Cited by 4 (2 self) – Add To MetaCart
-
Communication Complexity of Simultaneous Messages
- … computing f: Fairly strong multiparty communication complexity lower bounds of the form n=c k were…
- Cited by 8 (0 self) – Add To MetaCart
-
Some Bounds on Multiparty Communication Complexity of Pointer Jumping
- …=3\Gamma" ). This is the first lower bound on multiparty communication complexity that works for more than…
- Cited by 10 (1 self) – Add To MetaCart
-
The pattern matrix method for lower bounds on quantum communication
- … ⇔ t = 0. Theorem 1.1 shows its communication complexity to be Ω( √ n), while the next-best lower bound [2…
- Cited by 13 (5 self) – Add To MetaCart
-
Deterministic Approximate Counting of Depth-2 Circuits
- … exist. Here we are able to apply this idea, and use the lower bounds on multiparty communication…
- Cited by 15 (6 self) – Add To MetaCart
-
Multiparty Communication Complexity of Finite Monoids
- … to simulate a k-party protocol. Lower bounds for the multiparty communication complexity of specific functions…
- Cited by 1 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
