Lower Bounds on the Randomized Communication Complexity of Read-Once Functions

Nikos Leonardos, Michael Saks. Lower Bounds on the Randomized Communication Complexity of Read-Once Functions. Computational Complexity, 19(2):153-181, 2010. [doi]

Abstract

Abstract is missing.