Difference between revisions of "Boolean function"
Jon Awbrey (talk | contribs) |
Jon Awbrey (talk | contribs) (→Document history: fix link (several articles were merged @ GetWiki)) |
||
| Line 24: | Line 24: | ||
Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders. | Portions of the above article were adapted from the following sources under the [[GNU Free Documentation License]], under other applicable licenses, or by permission of the copyright holders. | ||
| − | * [http://www.getwiki.net/- | + | * [http://www.getwiki.net/-Boolean_Function Boolean function], [http://www.getwiki.net/ GetWiki]. |
* [http://wikinfo.org/index.php/Boolean_function Boolean function], [http://wikinfo.org/index.php/Main_Page Wikinfo]. | * [http://wikinfo.org/index.php/Boolean_function Boolean function], [http://wikinfo.org/index.php/Main_Page Wikinfo]. | ||
Revision as of 01:12, 7 April 2010
In mathematics, a finitary boolean function is a function of the form \(f : \mathbb{B}^k \to \mathbb{B},\) where \(\mathbb{B} = \{ 0, 1 \}\) is a boolean domain and where \(k\!\) is a nonnegative integer. In the case where \(k = 0,\!\) the function is simply a constant element of \(\mathbb{B}.\)
There are \(2^{2^k}\) such functions. These play a basic role in questions of complexity theory as well as the design of circuits and chips for digital computers. The properties of boolean functions play a critical role in cryptography, particularly in the design of symmetric key algorithms (see S-box).
See also
Template:Col-breakTemplate:Col-breakTemplate:Col-endExternal links
- Boolean Planet — boolean functions in cryptography.
Document history
Portions of the above article were adapted from the following sources under the GNU Free Documentation License, under other applicable licenses, or by permission of the copyright holders.
