Lower bounds in communication complexity based on factorization norms.

Nati Linial Adi Shraibman Lower bounds in communication complexity based on factorization norms. 699-708 2007 conf/stoc/2007 STOC http://doi.acm.org/10.1145/1250790.1250892 db/conf/stoc/stoc2007.html#LinialS07