Balanced Boolean function: Difference between revisions

Content deleted Content added
rm examples that are either incomplete (don't specify input ___domain) or wrong (depending on details of numerical encoding). Better to just stick with bits.
tag as one source
Line 1:
{{one source |date=April 2024}}
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.
 
Line 14 ⟶ 15:
 
[[Category:Boolean algebra]]
 
 
{{comp-sci-theory-stub}}