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