Under the auspices of the Computational Complexity Foundation (CCF)
We prove that for every Boolean function, the public-coin zero-error randomized communication complexity and the deterministic communication complexity are polynomially equivalent.
