ECCC-Report TR15-102https://eccc.weizmann.ac.il/report/2015/102Comments and Revisions published for TR15-102en-usMon, 22 Jun 2015 05:43:34 +0300
Paper TR15-102
| An $O(n^{0.4732})$ upper bound on the complexity of the GKS communication game |
Mario Szegedy
https://eccc.weizmann.ac.il/report/2015/102We give an $5\cdot n^{\log_{30}5}$ upper bund on the complexity of the communication game introduced by G. Gilmer, M. Kouck\'y and M. Saks \cite{saks} to study the Sensitivity Conjecture \cite{linial}, improving on their
$\sqrt{999\over 1000}\sqrt{n}$ bound. We also determine the exact complexity of the game up to $n\le 9$.
Mon, 22 Jun 2015 05:43:34 +0300https://eccc.weizmann.ac.il/report/2015/102