Small Error Versus Unbounded Error Protocols in the NOF Model [article]

Arkadev Chattopadhyay, Nikhil S. Mande
2016 Electronic colloquium on computational complexity  
We show that a simple function has small unbounded error communication complexity in the k-party number-on-forehead (NOF) model but every probabilistic protocol that solves it with sub-exponential advantage over random guessing has cost essentially Ω
dblp:journals/eccc/ChattopadhyayM16 fatcat:7osjm3mwifd2djlfhja5sup24q