Sciweavers

COCO
2008
Springer
146views Algorithms» more  COCO 2008»
14 years 28 days ago
A Direct Product Theorem for Discrepancy
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek