基于最大二部匹配的GKS对策的上界
An Upper Bound on the GKS Game via Max Bipartite Matching
摘要:
灵敏度猜想是一个关于布尔函数的度和灵敏度之间关系的长期猜想。在2015年,Justin Gilmer、Michal Koucklev和Michael Saks设计了一个沟通游戏,试图在这个猜想上取得进展。安德鲁·德鲁克独立地制定了这个游戏。在GKS游戏创建后不久,Nisan Szegedy以$O(n^{.4732})$的成本获得了游戏的协议。我们改进Szegedy的结果的成本$O(n^{.4696})$通过提供一种技术,以确定是否可以使用一组码字作为一个可行的策略,在这个游戏中。
英文摘要:
The sensitivity conjecture is a longstanding conjecture concerning the relationship between the degree and sensitivity of a Boolean function. In 2015, a communication game was formulated by Justin Gilmer, Michal Koucký, and Michael Saks to attempt to make progress on this conjecture. Andrew Drucker independently formulated this game. Shortly after the creation of the GKS game, Nisan Szegedy obtained a protocol for the game with a cost of $O(n^{.4732})$. We improve Szegedy's result to a cost of $O(n^{.4696})$ by providing a technique to identify whether a set of codewords can be used as a viable strategy in this game.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。