arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.07691cs.CC
收藏

布尔函数的灵敏度与证书复杂度

Sensitivity versus Certificate Complexity of Boolean Functions

Andris Ambainis, Krišjānis Prūsis, Jevgēnijs Vihrovs

摘要:

敏感度、块敏感度和证书复杂度是布尔函数的基本复杂性度量。著名的灵敏度猜想声称灵敏度与块灵敏度多项式相关。然而,众所周知,即使是指数界也很难获得。由于块敏感度已知与证书复杂度多项式相关,证明该猜想的等价物将表明证书复杂度与敏感度多项式相关。先前,已经表明$bs(f) \leq C(f) \leq 2^{s(f)-1} s(f) - (s(f)-1)$ .在这项工作中,我们给出了一个更好的上限$bs(f) \leq C(f) \leq \max\left(2^{s(f)-1}\left(s(f)-\frac 1 3\right), s(f)\right)$使用最近的定理限制的功能图的结构。我们还研究这些措施之间的关系,小1-灵敏度$s_1(f)$和任意0-灵敏度$s_0(f)$的功能。

英文摘要:

Sensitivity, block sensitivity and certificate complexity are basic complexity measures of Boolean functions. The famous sensitivity conjecture claims that sensitivity is polynomially related to block sensitivity. However, it has been notoriously hard to obtain even exponential bounds. Since block sensitivity is known to be polynomially related to certificate complexity, an equivalent of proving this conjecture would be showing that certificate complexity is polynomially related to sensitivity. Previously, it has been shown that $bs(f) \leq C(f) \leq 2^{s(f)-1} s(f) - (s(f)-1)$. In this work, we give a better upper bound of $bs(f) \leq C(f) \leq \max\left(2^{s(f)-1}\left(s(f)-\frac 1 3\right), s(f)\right)$ using a recent theorem limiting the structure of function graphs. We also examine relations between these measures for functions with small 1-sensitivity $s_1(f)$ and arbitrary 0-sensitivity $s_0(f)$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑