Boolean function: Difference between revisions

Revision as of 21:21, 12 March 2006

Revision as of 21:34, 12 March 2006

Line 13:

A boolean function can be written uniquely as a sum ([[Exclusive or|XOR]]) of products ([[Logical_conjunction|AND]]). This is known as the [[Algebraic Normal Form]] (ANF).

{| cellpadding="4"

{|

|-

|<math>f(x_1, x_2, \ldots , x_n) = </math>