An O(n⁰.⁴⁷³²) upper bound on the complexity of the GKS communication game

الأصل · EN

We give an 5· n₃₀5 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.