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

固定权重布尔函数的平均情形确定性查询复杂度

Average-case deterministic query complexity of boolean functions with fixed weight

Yuan Li, Haowei Wu, Yi Yang

AI总结:

本文研究均匀分布下布尔函数的平均情形确定性查询复杂度,给出固定权重函数的近紧上界,并利用切换引理分析 CNF/DNF 公式及构造匹配下界。

摘要:

我们研究布尔函数在均匀输入分布下的平均情形确定性查询复杂度,记为 D_ave(f),即计算布尔函数 f 的零误差决策树的最小平均深度。这一度量已在多个不同领域获得若干应用,但人们对它的理解仍然有限。我们研究具有固定权重的布尔函数,其中权重定义为输出为 1 的输入数量。我们证明,对于每个 n 变量布尔函数 f,都有 D_ave(f) ≤ max{ log(wt(f)/log n) + O(log log(wt(f)/log n)), O(1) },其中 wt(f) 表示权重。对于任意 4 log n ≤ m(n) ≤ 2^(n−1),我们证明:对于几乎所有固定权重 wt(f)=m(n) 的 n 变量布尔函数,该上界在相差一个加性对数项的意义下是紧的。Håstad 切换引理或 Rossman 切换引理[Comput. Complexity Conf. 137, 2019]分别意味着,对于宽度为 w 或大小为 s 的 CNF/DNF 公式,D_ave(f) ≤ n(1−1/O(w)) 或 D_ave(f) ≤ n(1−1/O(log s))。我们表明,对于任意 w ≥ 2 log n,存在一个宽度为 w、大小为 ⌈2^w/w⌉ 的 DNF 公式,使得 D_ave(f)=n(1−log n/Θ(w))。

英文摘要:

We study the $\textit{average-case deterministic query complexity}$ of boolean functions under a $\textit{uniform input distribution}$, denoted by $\mathrm{D}_\mathrm{ave}(f)$, the minimum average depth of zero-error decision trees that compute a boolean function $f$. This measure has found several applications across diverse fields, yet its understanding is limited. We study boolean functions with fixed weight, where weight is defined as the number of inputs on which the output is $1$. We prove $\mathrm{D}_\mathrm{ave}(f) \le \max \left\{ \log \frac{\mathrm{wt}(f)}{\log n} + O(\log \log \frac{\mathrm{wt}(f)}{\log n}), O(1) \right\}$ for every $n$-variable boolean function $f$, where $\mathrm{wt}(f)$ denotes the weight. For any $4\log n \le m(n) \le 2^{n-1}$, we prove the upper bound is tight up to an additive logarithmic term for almost all $n$-variable boolean functions with fixed weight $\mathrm{wt}(f) = m(n)$. Håstad's switching lemma or Rossman's switching lemma [Comput. Complexity Conf. 137, 2019] implies $\mathrm{D}_\mathrm{ave}(f) \leq n\left(1 - \frac{1}{O(w)}\right)$ or $\mathrm{D}_\mathrm{ave}(f) \le n\left(1 - \frac{1}{O(\log s)}\right)$ for CNF/DNF formulas of width $w$ or size $s$, respectively. We show there exists a DNF formula of width $w$ and size $\lceil 2^w / w \rceil$ such that $\mathrm{D}_\mathrm{ave}(f) = n \left(1 - \frac{\log n}{Θ(w)}\right)$ for any $w \ge 2\log n$.

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

↑