Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2406.08500 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912099236577280 |
|---|---|
| author | Li, Yaqiao Lavasani, Ali Mohammad Shakerinava, Mehran |
| author_facet | Li, Yaqiao Lavasani, Ali Mohammad Shakerinava, Mehran |
| contents | We give a streamlined short proof of Newman's theorem in communication complexity by applying the classical and the approximate Carathéodory's theorems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_08500 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Newman's theorem via Carathéodory Li, Yaqiao Lavasani, Ali Mohammad Shakerinava, Mehran Computational Complexity We give a streamlined short proof of Newman's theorem in communication complexity by applying the classical and the approximate Carathéodory's theorems. |
| title | Newman's theorem via Carathéodory |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2406.08500 |