Revision as of 10:11, 4 October 2011 edit M.r.ebraahimi (talk \| contribs) 4 edits No edit summary ← Previous edit		Revision as of 10:18, 4 October 2011 edit undo M.r.ebraahimi (talk \| contribs) 4 edits No edit summary Next edit →
Line 1: ~~hooo~~ .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. 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.

Balanced Boolean function: Difference between revisions