Pages that link to "Item:Q2460032"

The following pages link to A strong direct product theorem for corruption and the multiparty communication complexity of disjointness (Q2460032):

Displaying 19 items.

• A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
• One-way multiparty communication lower bound for pointer jumping with applications (Q532058) (← links)
• Kolmogorov complexity and combinatorial methods in communication complexity (Q534568) (← links)
• Disjointness is hard in the multiparty number-on-the-forehead model (Q626627) (← links)
• Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
• The corruption bound, log-rank, and communication complexity (Q1621501) (← links)
• Simulation theorems via pseudo-random properties (Q2281252) (← links)
• New strong direct product results in communication complexity (Q2796407) (← links)
• Upper and lower bounds on the power of advice (Q2816830) (← links)
• The multiparty communication complexity of set disjointness (Q2817790) (← links)
• A strong direct product theorem for disjointness (Q2875134) (← links)
• Simplified lower bounds on the multiparty communication complexity of disjointness (Q4601824) (← links)
• Simultaneous multiparty communication protocols for composed functions (Q5005112) (← links)
• Query Complexity of Sampling and Small Geometric Partitions (Q5364254) (← links)
• Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
• (Q5743425) (← links)
• Query-to-Communication Lifting Using Low-Discrepancy Gadgets (Q5856149) (← links)
• (Q5875509) (← links)
• Rectangles are nonnegative juntas (Q5890971) (← links)