Lower bounds in communication complexity based on factorization norms.

Nati Linial Adi Shraibman Lower bounds in communication complexity based on factorization norms. 368-394 2009 34 Random Struct. Algorithms 3 http://dx.doi.org/10.1002/rsa.20232 db/journals/rsa/rsa34.html#LinialS09