Newman's theorem via Carath\'eodory
Computational Complexity
2024-11-04 v2
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.
Cite
@article{arxiv.2406.08500,
title = {Newman's theorem via Carath\'eodory},
author = {Yaqiao Li and Ali Mohammad Lavasani and Mehran Shakerinava},
journal= {arXiv preprint arXiv:2406.08500},
year = {2024}
}