Newman's Theorem in Communication Complexity: A Geometric Proof Using Carathéodory's Theorems

A new geometric proof of Newman's theorem in communication complexity demonstrates that using public randomness offers only a logarithmic advantage over private randomness in communication cost.