1 citations · 1 across the 1 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2024★ 1 cited
An XOR Lemma for Deterministic Communication Complexity
Siddharth Iyer, Anup Rao
We prove a lower bound on the communication complexity of computing the -fold xor of an arbitrary function , in terms of the communication complexity and rank of . We prov…
cs.CC2023
XOR Lemmas for Communication via Marginal Information
Siddharth Iyer, Anup Rao
We define the of a communication protocol, and use it to prove XOR lemmas for communication complexity. We show that if every -bit protocol has b…