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

06/22/2015

∙

by   Mario Szegedy, et al.

∙

0

∙

share

We give an 5· n^_305 upper bund on the complexity of the communication game introduced by G. Gilmer, M. Koucký and M. Saks saks to study the Sensitivity Conjecture linial, improving on their √(999 1000)√(n) bound. We also determine the exact complexity of the game up to n< 9.