On multiparty communication with large versus unbounded error

@article{Sherstov2016OnMC,
  title={On multiparty communication with large versus unbounded error},
  author={Alexander A. Sherstov},
  journal={Electronic Colloquium on Computational Complexity (ECCC)},
  year={2016},
  volume={23},
  pages={138}
}
The communication complexity of F with unbounded error is the limit of the ε-error randomized complexity of F as ε → 1/2. Communication complexity with weakly unbounded error is defined similarly but with an additive penalty term that depends on 1/2− ε . Explicit functions are known whose two-party communication complexity with unbounded error is… CONTINUE READING