Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
Affiliation:
1
0
0
2
It is shown that the shared-randomness cost of robust CDS is lower bounded by the logarithm of deterministic SMP communication complexity, even when communication and private randomness are unrestricted.