决策表的收缩与DNF公式
Shrinkage of Decision Lists and DNF Formulas
摘要:
我们建立了几乎紧界的预期收缩的决策列表和DNF公式下的$p$ -随机限制$\mathbf R_p$的所有值的$p \in [0,1]$。对于具有域$\{0,1\}^n$的函数$f$,令$\mathrm{DL}(f)$表示计算$f$的决策列表的最小大小。我们表明,\[ \mathbb E[\ \mathrm{DL}(f{\upharpoonright}\mathbf R_p)\ ] \le \mathrm{DL}(f)^{\log_{2/(1-p)}(\frac{1+p}{1-p})}. \]例如,当$\sqrt{\mathrm{DL}(f)}$。对于布尔函数$f$,我们获得了关于DNF公式大小加上$1$的相同收缩界限(即,在不等式的两侧用$\mathrm{DNF}(\cdot)+1$代替$\mathrm{DL}(\cdot)$)。
英文摘要:
We establish nearly tight bounds on the expected shrinkage of decision lists and DNF formulas under the $p$-random restriction $\mathbf R_p$ for all values of $p \in [0,1]$. For a function $f$ with domain $\{0,1\}^n$, let $\mathrm{DL}(f)$ denote the minimum size of a decision list that computes $f$. We show that \[ \mathbb E[\ \mathrm{DL}(f{\upharpoonright}\mathbf R_p)\ ] \le \mathrm{DL}(f)^{\log_{2/(1-p)}(\frac{1+p}{1-p})}. \] For example, this bound is $\sqrt{\mathrm{DL}(f)}$ when $p = \sqrt{5}-2 \approx 0.24$. For Boolean functions $f$, we obtain the same shrinkage bound with respect to DNF formula size plus $1$ (i.e., replacing $\mathrm{DL}(\cdot)$ with $\mathrm{DNF}(\cdot)+1$ on both sides of the inequality).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。