An upper bound on the complexity of the GKS communication game
M Szegedy - arXiv preprint arXiv:1506.06456, 2015 - arxiv.org
arXiv preprint arXiv:1506.06456, 2015•arxiv.org
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$.
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$.
We give an 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 bound. We also determine the exact complexity of the game up to .
arxiv.org