Pages that link to "Item:Q1327389"
From MaRDI portal
The following pages link to The BNS lower bound for multi-party protocols is nearly optimal (Q1327389):
Displaying 13 items.
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- Hadamard tensors and lower bounds on multiparty communication complexity (Q371197) (← links)
- The NOF multiparty communication complexity of composed functions (Q496305) (← links)
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs (Q1201152) (← links)
- The Multiparty Communication Complexity of Set Disjointness (Q2817790) (← links)
- Quantum multiparty communication complexity and circuit lower bounds (Q3616221) (← links)
- (Q4612486) (← links)
- Unexpected upper bounds on the complexity of some communication games (Q4632411) (← links)
- Interleaved Group Products (Q4634030) (← links)
- (Q5005112) (← links)
- (Q5090432) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- (Q5875509) (← links)
