Posted by: atri | February 14, 2009

Lecture 13: Communication Complexity

In Wednesday’s lecture, we looked at the communication complexity of the functions I mentioned in the last lecture blog post. We proved that the (deterministic) communication complexity of both the equality and disjointness function was \Omega(n). Next lecture, we are going to see a non-trivial upper bound for the equality condition for randomized¬†communication complexity. The protocol will use the distance property of the Reed-Solomon code.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s


%d bloggers like this: