Michela Ceria edited bits4.tex  about 8 years ago

Commit id: 637bc51ec70f7538b0ccdcb66e5ddb2ca0889665

deletions | additions      

       

\end{Example}  In general we have  \begin{Theorem}[Absolute Normal Form Theorem]  Any function $f$ from $(\Fb)^n$ to $\Fb$ , with n ? N, \in \NN,  (i.e., any function   with n binary inputs and  only one binary output) can be written by