Ali Mohammad Lavasani, Yaqiao Li, Mehran Shakerinava
{"title":"Newman's theorem via Carathéodory","authors":"Ali Mohammad Lavasani, Yaqiao Li, Mehran Shakerinava","doi":"arxiv-2406.08500","DOIUrl":null,"url":null,"abstract":"We give a streamlined short proof of Newman's theorem in communication\ncomplexity by applying the classical and the approximate Carath\\'eodory's\ntheorems.","PeriodicalId":501024,"journal":{"name":"arXiv - CS - Computational Complexity","volume":"82 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2406.08500","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
