most citedLower Bound for the Communication Complexity of the Russian Cards Problem

8 citations · 8 across the 1 of their papers we have counts for

collaborators
Showing cs.LOShow all

1 paper · 1 filter

cs.LO2008★ 8 cited

Lower Bound for the Communication Complexity of the Russian Cards Problem

Aiswarya Cyriac, K. Murali Krishnan

In this paper it is shown that no public announcement scheme that can be modeled in Dynamic Epistemic Logic (DEL) can solve the Russian Cards Problem (RCP) in one announcement. Sin…