Group:Complexity,Cryptography and Algorithms Group
Title:Group Talk
Speaker: Kevin Matulef University
Time: 2010-12-17 13:30-2010-12-17 15:00
Venue:FIT 1-222

Abstract:

We will continue with the three-step approximate norm-based approach to getting lower bounds on randomized communication complexity.  Kevin will present some actual lower bounds from Chapter 7 of the Lee-Shraibman survey.




Short Bio: