Balanced boolean function
In mathematics and computer science, a balanced boolean function is a boolean function whose output yields as many 0s as 1s over its input set. This means that for a uniformly random input string of bits, the probability of getting a 1 is 1/2. An example of a balanced boolean function is the function that assigns a 1 to every even number and 0 to all odd numbers (likewise the other way around). The same applies for functions assigning 1 to all positive numbers and 0 otherwise. A Boolean function of n bits is balanced if it takes the value 1 with probability 1⁄2.
primaryTopic
Balanced boolean function
In mathematics and computer science, a balanced boolean function is a boolean function whose output yields as many 0s as 1s over its input set. This means that for a uniformly random input string of bits, the probability of getting a 1 is 1/2. An example of a balanced boolean function is the function that assigns a 1 to every even number and 0 to all odd numbers (likewise the other way around). The same applies for functions assigning 1 to all positive numbers and 0 otherwise. A Boolean function of n bits is balanced if it takes the value 1 with probability 1⁄2.
has abstract
In mathematics and computer sc ...... value 1 with probability 1⁄2.
@en
В булевой алгебре, сбалансиров ...... нечетное число (или наоборот).
@ru
Link from a Wikipage to an external page
Wikipage page ID
24,635,433
Wikipage revision ID
545,743,743
subject
hypernym
type
comment
In mathematics and computer sc ...... value 1 with probability 1⁄2.
@en
В булевой алгебре, сбалансиров ...... а выходе значения 1 равна 1/2.
@ru
label
Balanced boolean function
@en
Сбалансированная булева функция
@ru