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

关于对称布尔函数的概率度

On the Probabilistic Degrees of Symmetric Boolean functions

Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh

摘要:

布尔函数$f:\{0,1\}^n\rightarrow \{0,1\}$的概率度被定义为最小的$d$,使得在每个点处存在最多$d$的度的随机多项式$\mathbf{P}$,该随机多项式以高概率与$f$一致。由Razborov(1987)引入的布尔函数(特别是对称布尔函数)概率度的上界和下界已被用于证明显式下界、设计伪随机生成器和设计组合问题的算法。本文刻画了在所有特征固定(正或零)域上直至多对数因子的对称布尔函数的概率度。

英文摘要:

The probabilistic degree of a Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is defined to be the smallest $d$ such that there is a random polynomial $\mathbf{P}$ of degree at most $d$ that agrees with $f$ at each point with high probability. Introduced by Razborov (1987), upper and lower bounds on probabilistic degrees of Boolean functions --- specifically symmetric Boolean functions --- have been used to prove explicit lower bounds, design pseudorandom generators, and devise algorithms for combinatorial problems. In this paper, we characterize the probabilistic degrees of all symmetric Boolean functions up to polylogarithmic factors over all fields of fixed characteristic (positive or zero).

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

↑