Newman's theorem via Carath\'eodory

TL;DR

This paper presents a concise proof of Newman's theorem in communication complexity using classical and approximate Carathéodory's theorems, simplifying the understanding of the theorem.

Contribution

It offers a streamlined proof of Newman's theorem by leveraging classical and approximate Carathéodory's theorems, providing a clearer and more accessible approach.

Findings

Simplified proof of Newman's theorem

Application of Carathéodory's theorems in communication complexity

Enhanced understanding of theorem's foundations

Abstract

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