Deterministic communication vs. Partition number

Abstract

We show that deterministic communication complexity can be superlogarithmic in the partition number of the associated communication matrix. We also obtain near-optimal deterministic lower bounds for the Clique vs. Independent Set problem, which in particular yields new lower bounds for the log-rank conjecture. All of these results follow from a simple adaptation of a communication-to-query simulation theorem of Raz and McKenzie [Combinatorica, 19 (1999), pp. 403-435] together with lower bounds for the analogous query complexity questions.

Publication Title

SIAM Journal on Computing

Link to Full Text

Share

COinS