The following pages link to (Q5302084):
Displaying 10 items.
- A direct product theorem for two-party bounded-round public-coin communication complexity (Q343852) (← links)
- Kolmogorov complexity and combinatorial methods in communication complexity (Q534568) (← links)
- New bounds on classical and quantum one-way communication complexity (Q1029354) (← links)
- Simulation theorems via pseudo-random properties (Q2281252) (← links)
- New Strong Direct Product Results in Communication Complexity (Q2796407) (← links)
- The Multiparty Communication Complexity of Set Disjointness (Q2817790) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- Communication Lower Bounds Using Directional Derivatives (Q5501937) (← links)
- (Q5875509) (← links)
