Separating the Communication Complexitie
✍
V. Grolmusz
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 504 KB
We prove in this paper that it is much harder to evaluate depth-2, size- \(N\) circuits with MOD \(m\) gates than with MOD \(p\) gates by \(k\)-party communication protocols: we show a \(k\)-party protocol which communicates \(O(1)\) bits to evaluate circuits with MOD \(p\) gates, while evaluating c