0.4732) upper bound on the complexity of the GKS communication game

Mario Szegedy. 0.4732) upper bound on the complexity of the GKS communication game. Electronic Colloquium on Computational Complexity (ECCC), 22:102, 2015. [doi]

Abstract

Abstract is missing.