Toggle navigation
OpenReview
.net
Login
×
Go to
DBLP
homepage
Newman's theorem via Carathéodory
Ali Mohammad Lavasani
,
Yaqiao Li
,
Mehran Shakerinava
Published: 01 Jan 2024, Last Modified: 25 Jan 2025
CoRR 2024
Everyone
Revisions
BibTeX
CC BY-SA 4.0
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.
Loading