Sagnik Mukhopadhyay
Sagnik Mukhopadhyay
Home
Experience
Publications
Contact
Project
Light
Dark
Automatic
Direct sum
Lower Bounds for Elimination via Weak Regularity
We consider the problem of elimination in communication complexity, that was first raised by Ambainis et al. and later studied by Beimel et al. for its connection to the famous direct sum question.
Arkadev Chattopadhyay
,
Michal Koucký
,
Bruno Loff
,
Sagnik Mukhopadhyay
Tribes is Hard in Message-passing Model
We consider the point-to-point message passing model of communication in which there are $k$ processors with individual private inputs, each $n$-bit long. Each processor is located at the node of an underlying undirected graph and has access to private random coins.
Arkadev Chattopadhyay
,
Sagnik Mukhopadhyay
Cite
×