TL;DR本文通过研究 n 维立方体图中每个 $(2^{n-1}+1)$- 顶点诱导子图的最大度数,证明了布尔函数的灵敏度和度数之间存在多项式关系,从而解决了一个理论计算机科学中的基础性问题:感度猜想。
Abstract
In this paper, we show that every $(2^{n-1}+1)$-vertex induced subgraph of
the $n$-dimensional cube graph has maximum degree at least $\sqrt{n}$. This
result is best possible, and improves a logarithmic lower bou