A decision tree $T$ for $f : \{-1,1\}^n \to \{-1,1\}$ can be thought of as a deterministic algorithm which, given adaptive query access to the bits of an unknown string $x \in \{-1,1\}^n$, outputs $f(x)$. E.g., to describe a natural decision tree for $f = \mathrm{Maj}_3$ in words: “Query $x_1$, then $x_2$. If they [...]

## Recent comments

Ohad Klein: In lemma 46 (48) - should it be $i \not \in J'_x$? (In its ...Ohad Klein: Another one - is the symbol "union" is redundant in 37b,c?Ohad Klein: I might be misunderstanding 37b. Suppose k=n=1. Then $E[f^q]...Ohad Klein: I might be wrong, but in ex. 9.31 (i.e. remark 9.29), I trie...Ohad Klein: sorry, my bad, again!Ohad Klein: In 23, is it $q \leq 2+2\epsilon$?Ohad Klein: ctrl+f: Paresval.