We give an 5⋅nlog305 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 1000999n bound. We also determine the exact complexity of the game up to n≤9.
@article{arxiv.1506.06456,
title = {An $O(n^{0.4732})$ upper bound on the complexity of the GKS communication game},
author = {Mario Szegedy},
journal= {arXiv preprint arXiv:1506.06456},
year = {2015}
}