Average-case deterministic query complexity of boolean functions with fixed weight
CoRR(2024)
摘要
We explore the average-case deterministic query complexity of
boolean functions under the uniform distribution, denoted by
D_ave(f), the minimum average depth of zero-error decision
tree computing a boolean function f. This measure found several applications
across diverse fields. We study D_ave(f) of several common
functions, including penalty shoot-out functions, symmetric functions, linear
threshold functions and tribes functions. Let wt(f) denote the
number of the inputs on which f outputs 1. We prove that
D_ave(f) ≤logwt(f)/log n +
O(loglogwt(f)/log n) when wt(f) ≥
4 log n (otherwise, D_ave(f) = O(1)), and that for almost
all fixed-weight functions, D_ave(f) ≥logwt(f)/log n - O( loglogwt(f)/log
n), which implies the tightness of the upper bound up to an additive
logarithmic term. We also study D_ave(f) of circuits. Using
Håstad's switching lemma or Rossman's switching lemma [Comput. Complexity
Conf. 137, 2019], one can derive upper bounds D_ave(f) ≤
n(1 - 1/O(k)) for width-k CNFs/DNFs and
D_ave(f) ≤ n(1 - 1/O(log s)) for
size-s CNFs/DNFs, respectively. For any w ≥ 1.1 log n, we prove the
existence of some width-w size-(2^w/w) DNF formula with
D_ave (f) = n (1 - log n/Θ(w)),
providing evidence on the tightness of the switching lemmas.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要