Conference paper
A composition theorem for conical juntas
Mika Göös, T. S. Jayram
CCC 2016
We show that randomized communication complexity can be superlogarithmic in the partition number of the associated communication matrix, and we obtain near-optimal randomized lower bounds for the Clique versus Independent Set problem. These results strengthen the deterministic lower bounds obtained in prior work (Göös, Pitassi, and Watson, FOCS'15). One of our main technical contributions states that information complexity when the cost is measured with respect to only 1-inputs (or only 0-inputs) is essentially equivalent to information complexity with respect to all inputs.
Mika Göös, T. S. Jayram
CCC 2016
Michael B. Cohen, T. S. Jayram, et al.
SOSA 2018
Mika Göös, T. S. Jayram, et al.
ICALP 2017
Mika Göös, T. S. Jayram, et al.
ICALP 2017