Content deleted Content added
source and expand |
untag |
||
Line 1:
In [[mathematics]] and [[computer science]], a '''balanced Boolean function''' is a [[Boolean function]] whose output yields as many '''0'''s as '''1'''s over its [[Domain of a function|input set]]. This means that for a uniformly random input string of bits, the probability of getting a '''1''' is 1/2.{{r|bsw}}
| |||