The following pages link to (Q2969658):
Displaying 5 items.
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- Communication complexity of set-disjointness for all probabilities (Q2816409) (← links)
- The Probabilistic Communication Complexity of Set Intersection (Q4030193) (← links)
- Rectangles are nonnegative juntas (Q5890971) (← links)
- Communication costs in a geometric communication network (Q6052702) (← links)