No results for "Category:Families of Boolean functions" (auto) in titles.

Suggestions for article titles:

1. Boolean function: ☞ This page belongs to resource collections on Logic and Inquiry. A finitary boolean function is a function of the form f : B k → B , {\displaystyle f:\mathbb {B} ^{k}\to \mathbb {B} ,} where B = { 0 , 1 } {\displaystyle \mathbb {B} =\{0 ... [100%] 2023-04-03 [Inquiry] [Open Educational Resource]...
2. Boolean function: function of the algebra of logic A function whose arguments, as well as the function itself, assume values from a two-element set (usually $\{0,1\}$). Boolean functions are one of the main subjects of discrete mathematics, in particular, of ... (Mathematics) [100%] 2023-10-17
3. Analysis of Boolean functions: In mathematics and theoretical computer science, analysis of Boolean functions is the study of real-valued functions on { 0 , 1 } n {\displaystyle \{0,1\}^{n}} or { − 1 , 1 } n {\displaystyle \{-1,1\}^{n}} (such functions are sometimes known as pseudo ... (Study of Boolean functions via discrete Fourier analysis) [89%] 2023-05-26 [Boolean algebra] [Mathematical optimization]...
4. Boolean functions, minimization of: A representation of Boolean functions by normal forms (cf. Boolean functions, normal forms of) that are most simple relative to some measure of complexity. (Mathematics) [89%] 2023-10-12
5. Analysis of Boolean functions: In mathematics and theoretical computer science, analysis of Boolean functions is the study of real-valued functions on \displaystyle{ \{0,1\}^n }[/math] or \displaystyle{ \{-1,1\}^n }[/math] (such functions are sometimes known as pseudo-Boolean functions) from a ... (Study of Boolean functions via discrete Fourier analysis) [89%] 2022-12-12 [Boolean algebra] [Mathematical optimization]...
6. Studies of Boolean functions: These articles about Boolean functions use a similar style and terminology. They are created by Watchduck a.k.a. [89%] 2024-05-03 [Boolean functions]
7. Properties of Boolean functions: The number of Boolean functions with arity ≤ n {\displaystyle \leq n} is 2 2 n {\displaystyle 2^{2^{n}}} ( A001146). Many of them are related to each other, and can be grouped in equivalence classes. [89%] 2024-09-28 [Studies of Boolean functions]
8. Gender of Boolean functions: A Boolean function shall be called male, iff its root is sharp (i. e. [89%] 2024-10-10 [Gender of Boolean functions]
9. Permutations of Boolean functions: Analogous to hard and soft properties of Boolean functions, there are also hard and soft permutations. A permutation is hard, when the domain is the infinite set of all Boolean functions. [89%] 2025-01-23 [Studies of Boolean functions]
10. Families of Boolean functions: Boolean functions belong to the same family, when they can be transformed into each other by negating arguments. The size of a family is always a power of two. [89%] 2025-01-05 [Families of Boolean functions]
11. Nonlinearity of Boolean functions: The nonlinearity of a Boolean function measures how far it is from being a linear Boolean function. It is the smallest Hamming distance of its truth table to that of a linear. [89%] 2025-01-05 [Studies of Euler diagrams]
12. Mentors of Boolean functions: The mentor is a rather dubious soft property of a BF. But it seems surprisingly interesting. [89%] 2025-01-05 [Mentors of Boolean functions]
13. Noble Boolean functions: Noble Boolean functions are those who are their own Zhegalkin twins, i.e. the binary expression of their ANF is equal to their truth table. [86%] 2024-01-08 [Boolean functions] [ Zhegalkin stuff]...
14. Linear Boolean functions: Linear Boolean functions are Walsh functions and their negations. A Walsh function is a variadic XOR (a.k.a. [86%] 2024-05-16 [Linear Boolean functions]
15. Boolean: Este artículo o sección necesita referencias que aparezcan en una publicación acreditada. Este aviso fue puesto el 9 de octubre de 2014. El tipo de dato lógico, también conocido como «booleano» en honor a George Boole, es en computación aquel ... [83%] 2023-06-01
16. Boolean-valued function: A Boolean-valued function (sometimes called a predicate or a proposition) is a function of the type f : X → B, where X is an arbitrary set and where B is a Boolean domain, i.e. a generic two-element set ... [81%] 2023-03-29 [Boolean algebra]
17. Boolean-valued function: ☞ This page belongs to resource collections on Logic and Inquiry. A boolean-valued function is a function of the type f : X → B , {\displaystyle f:X\to \mathbb {B} ,} where X {\displaystyle X\!} is an arbitrary set and where B ... [81%] 2023-04-10 [Inquiry] [Open Educational Resource]...
18. Monotone Boolean function: A Boolean function $ f ( x _ {1} \dots x _ {n} ) $, $ n = 0 , 1 \dots $ having the following property: If for some sets $ \widetilde \alpha = ( \alpha _ {1} \dots \alpha _ {n} ) $ and $ \widetilde \beta = ( \beta _ {1} \dots \beta ... (Mathematics) [81%] 2023-07-23
19. Pseudo-Boolean function: In mathematics and optimization, a pseudo-Boolean function is a function of the form where B = {0, 1} is a Boolean domain and n is a nonnegative integer called the arity of the function. A Boolean function is then a ... (Generalization of binary functions) [81%] 2023-12-13 [Mathematical optimization]
20. Symmetric Boolean function: In mathematics, a symmetric Boolean function is a Boolean function whose value does not depend on the order of its input bits, i.e., it depends only on the number of ones (or zeros) in the input. For this reason ... [81%] 2023-07-26 [Boolean algebra] [Cryptography]...