Relating Communication Protocols and Polynomials



Friday, 30 December 2016, 16:00 to 17:30


  • A-201 (STCS Seminar Room)


Lee and Zhang showed that the communication complexity of "f composed with g" is high when f is hard to approximate with a low degree polynomial (also g has to be from a good class of functions, more details will be given in the talk). In this talk, we will look at a proof of this result by transforming a communication protocol for "f composed with g" into a polynomial for f.