A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Small Error Versus Unbounded Error Protocols in the NOF Model
[article]
2016
Electronic colloquium on computational complexity
Preserved Fulltext
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