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

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ý and M. Saks \cite{saks} to study the Sensitivity Conjecture \cite{linial}, improving on their $\sqrt{\frac{999}{1000}}\sqrt{n}$ bound. We also determine the exact complexity of the game up to $n\le 9$.

Cited by in corpus (1)

• An improvement of the upper bound for GKS communication game