Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR15-102 | 22nd June 2015 05:43

An $O(n^{0.4732})$ upper bound on the complexity of the GKS communication game

RSS-Feed




TR15-102
Authors: Mario Szegedy
Publication: 22nd June 2015 05:43
Downloads: 462
Keywords: 


Abstract:

We 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$.



ISSN 1433-8092 | Imprint