Newman's theorem via Carathéodory

Yaqiao Li, Ali Mohammad Lavasani, Mehran Shakerinava

We give a streamlined short proof of Newman's theorem in communication complexity by applying the classical and the approximate Carathéodory's theorems.