The following pages link to (Q2913808):
Displaying 15 items.
- Communication complexity with small advantage (Q2182866) (← links)
- Arthur-Merlin streaming complexity (Q2347803) (← links)
- Low correlation noise stability of symmetric sets (Q2664537) (← links)
- Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568) (← links)
- Sketching and Embedding are Equivalent for Norms (Q4571922) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- Communication Complexity of Statistical Distance (Q5002655) (← links)
- One-Sided Error Communication Complexity of Gap Hamming Distance. (Q5005103) (← links)
- Anticoncentration and the Exact Gap-Hamming Problem (Q5074948) (← links)
- Lifting Theorems for Equality (Q5090501) (← links)
- Two Party Distribution Testing: Communication and Security (Q5091163) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- (Q5121897) (← links)
- Rectangles Are Nonnegative Juntas (Q5890971) (← links)
- Communication and information complexity (Q6200329) (← links)
