Question: [34] In Theorem 6.11.1 it was shown that for a deterministic protocol of say, complexity O(1), to compute the identity function Alice and Bob need

[34] In Theorem 6.11.1 it was shown that for a deterministic protocol of say, complexity O(1), to compute the identity function Alice and Bob need to exchange about C(y) bits, even if the required information C(y|x) is much less than C(y). Show that for randomized protocols the communication complexity is close to C(y|x).

Comments. Source: [H.M. Buhrman, M. Kouck´y, and N.K. Vereshchagin, Proc. 23rd IEEE Conf. Comput. Complexity, 2008, pp. 321–331].

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Elementary Probability For Applications Questions!