MathSciNet Relay Station
MathSciNet bibliographic data
MR2402497 (2009f:68056) 68Q17
Linial, Nati; Shraibman, Adi Lower bounds in communication complexity based on factorization norms. STOC'07—Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 699–708, ACM, New York, 2007.
Article
 
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2015, American Mathematical Society
Privacy Statement