Sciweavers

COCO
2009
Springer
119views Algorithms» more  COCO 2009»
13 years 11 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman