GKS通信对策上界的改进
An improvement of the upper bound for GKS communication game
摘要:
GKS博弈是由Justin Gilmer、Michal Koucky和Michael Saks在他们对敏感性猜想的研究中提出的。Mario Szegedy发明了一种协议,用于游戏,成本为$O(n^{0.4732})$。然后DeVon Ingram利用二分匹配得到了一个代价为$O(n^{0.4696})$的协议。本文对Ingram的方法进行了改进,设计了一个代价为$O(n^{0.4693})$的协议.
英文摘要:
The GKS game was formulated by Justin Gilmer, Michal Koucky, and Michael Saks in their research of the sensitivity conjecture. Mario Szegedy invented a protocol for the game with the cost of $O(n^{0.4732})$. Then a protocol with the cost of $O(n^{0.4696})$ was obtained by DeVon Ingram who used a bipartite matching. We propose a slight improvement of Ingram's method and design a protocol with cost of $O(n^{0.4693})$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。