Complexity class of sensitivity

Question

Let $f:\{0,1\}^n\rightarrow \{0,1\}$ be a Boolean function.

Let $[n]=\{1,2,\dots,n\}$.

If $i\in[n],ドル let $\Bbb 1_i$ be length $n$ vector with all 0ドル$s except 1ドル$ at $i$th position.

If $B\subseteq [n],ドル then $\Bbb 1_B$ be the length $n$ vector with 1ドル$s only in positions marked by $B$.

If $i\in[n]$ and $x\in\{0,1\}^n,ドル let $x^i=x\oplus\Bbb 1_i$ where $\oplus$ is $XOR$ operation.

If $B\subseteq [n]$ and $x\in\{0,1\}^n,ドル let $x^{B}=x\oplus\Bbb 1_B$ where $\oplus$ is $XOR$ operation.

Sensitivity of $f$ at input $x$ is $$S_x(f) = |\{i:f(x)\neq f(x^i)\}|$$

Sensitivity of $f$ is $$S(f)=\max_xS_x(f)$$

Block Sensitivity of $f$ at input $x,ドル $BS_x(f)$ is maximum $r$ such that there is a set of disjoint subsets $\{B_i\}_{i=1}^r$($\forall i\neq j,ドル $B_i\cap B_j=\emptyset$) such that $$\forall j\mbox{, }f(x)\neq f(x^{B_j})$$

Block Sensitivity of $f$ is $$BS(f)=\max_xBS_x(f)$$

Given $f$ in $n$-variables, would it be reasonable to ask the complexity class of deciding $S(f)>c$ and $BS(f)>c$ for a fixed $c>0$? I understand that describing a Boolean function takes 2ドル^n$ bits fully.

Does computing $BS(f)$ also take $O(2^{n+\epsilon})$ time as in answers below?

• Włodzimierz Holsztyński: Is the length of a 0-1 vector x simply $\ \sum x\ $? Is the length of $\ \mathbb 1_B\ $ simply $\ |B|\ $?
• Turbo: No length of vector $x\in\{0,1\}^n$ is $n$.
• Włodzimierz Holsztyński: Thank you. The length of a word is the number of characters of the word--I guess that's the idea here.

Answer 1

For fixed $c$ the complexity is polynomial time. In fact, you can calculate $S(f)$ in polynomial time by just going over all inputs and calculating the pointwise sensitivity. This takes $O(n2^n)$ on a RAM machine. Given $c > 0,ドル there are at most $(2+c)^n = (2^n)^{\log_2 (2+c)}$ ways to choose $c+1$ disjoint subsets, and you can check whether there is a point sensitive to all of them in time $O(2^n)$. In total, this gives an $O((2^n)^{\log_2 (2+c)+1})$ algorithm for determining whether $bs(f) > c$.

This leaves open the question of calculating the block sensitivity of a function $f$.

• Turbo: Is a matching lower bound a possibility?
• Yuval Filmus: No, we don't know how to prove superlinear lower bounds on time.

Answer 2

[An alternative answer for $BS(f)$]

There is a paper related to this problem.

Scott Aaronson: Algorithms for Boolean Function Query Properties. SIAM J. Comput. 32(5): 1140-1157 (2003)

The paper gives an $O(N^{\log_2 5} \log N)$ algorithm for computing $BS(f)$ if $f$ is given by a truth table of size $N=2^n$. Thus, even if $c$ is not fixed, deciding $BS(f) > c$ is in P.

• Hiroki Morizumi: "c is not fixed" -- I mean that c is not a constant.
• Turbo: I do not understand the result. Usually people take c fixed.
• Turbo: I totally missed understanding this. So this answer tackles $BS(f)$ (looks superquadratic)?