.png){kind=icon}
.png){kind=icon}
Return
Average-Case Deterministic Query Complexity of Boolean Functions with Fixed Weight
.png){kind=icon}
PRE
AI
DOI：10.1007/978-981-95-0215-8_15.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We study the average-case deterministic query complexity of boolean functions under a uniform input distribution, denoted by D-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 D-ave(f) <= max{log wt(f)/log n + O(log log wt(f)/log n), O(1)} for every n-variable boolean function.f, where.wt(f) denotes the weight. For any.4 log n = m(n) <= 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 wt(f) = m(n). Hastad's switching lemma or Rossman's switching lemma [Comput. Complexity Conf. 137, 2019] implies D-ave(f) <= n(1 - 1/O(w)) or D-ave(f) <= n(1 - 1/O(log s)) for CNF/DNF formulas of width.w or size.s, respectively. We show there exists a DNF formula of width.w and size[2(w) /w] such that D-ave(f) = n(1 - log n/circle plus(w)) for any w >= 2 log n.
Keywords:
average-case query complexity
decision tree
weight
switching lemma
criticality
Journal
C
IF:
0
Papers:
24
Citations:
0