37 search results - page 8 / 8 » New bounds on classical and quantum one-way communication co... |
100
click to vote
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We introduce the (private) entropy of a directed graph (in a new network coding sense) as well as a number of related concepts. We show that the entropy of a directed graph is ide...
FOCS
2007
IEEE
15 years 3 months ago
2007
IEEE
We develop a new technique of proving lower bounds for the randomized communication complexity of boolean functions in the multiparty `Number on the Forehead' model. Our meth...