Boolean function: Difference between revisions

Revision as of 01:29, 17 October 2005

Revision as of 14:27, 19 November 2005

Line 6:

There are <math>2^{2^n}</math> such functions; these play a basic role in questions of [[complexity theory]] as well as the design of circuits and chips for [[digital computer]]s. The properties of boolean functions play a critical role in [[cryptography]], particularly in the design of [[symmetric key algorithm]]s (see [[S-box]]).

A '''Boolean operation''' on Boolean-valued functions combines values point-wise (for example, by [[XOR]]).

==See also==