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: Are the indexing in (the start of) 7 OK?Ohad Klein: "learning algorithm running in time in time"Amir: In the proof of Theorem 16, and in the equation immediately ...Ohad Klein: In example 6, should "of codimension less than n" be "of pos...Ohad Klein: In 15c (18c in the book), I think it should be $\cap_j{V_j}$...Ohad Klein: Bracket typo: In the proof of thm 10 (12 in the book), $sgn(...Ohad Klein: Oops, my bad.