Content deleted Content added
source and expand |
Citation bot (talk | contribs) Altered doi-broken-date. | Use this bot. Report bugs. | #UCB_CommandLine |
||
| (5 intermediate revisions by 3 users not shown) | |||
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}}
Line 27 ⟶ 26:
| publisher = Association for Computing Machinery
| title = Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22–24, 2005
| year = 2005| isbn = 1-58113-960-8 }}</ref>
<ref name=ch>{{citation
Line 34 ⟶ 33:
| doi = 10.1049/ip-cdt:19981769
| issue = 1
| journal = IEE Proceedings
| page = 52
| title = Balanced Boolean functions
| volume = 145
| year = 1998
}}</ref>
<ref name=szz>{{citation
Line 52:
| title = Advances in Cryptology – CRYPTO '93, 13th Annual International Cryptology Conference, Santa Barbara, California, USA, August 22–26, 1993, Proceedings
| volume = 773
| year = 1993| isbn = 978-3-540-57766-9 }}</ref>
}}
[[Category:Boolean algebra]]
| |||