This is a book about boolean functions, \begin{equation*} f : \{0,1\}^n \to \{0,1\}. \end{equation*} Here $f$ maps each length-$n$ binary vector, or string, into a single binary value, or bit. Boolean functions arise in many areas of computer science and mathematics. Here are some examples:

[...]

## 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.