Balanced Boolean function: Difference between revisions

Revision as of 23:17, 23 July 2024

Revision as of 00:51, 5 August 2024

Line 12:

== References ==

*{{citation

* [http://portal.acm.org/citation.cfm?id=1060627 Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read], Annual ACM Symposium on Theory of Computing

| last1 = Benjamini | first1 = Itai | author1-link = Itai Benjamini

| last2 = Schramm | first2 = Oded | author2-link = Oded Schramm

| last3 = Wilson | first3 = David Bruce

| editor1-last = Gabow | editor1-first = Harold N.

| editor2-last = Fagin | editor2-first = Ronald

| arxiv = math.PR/0410282

* | contribution [http://portal.acm.org/citation.cfm?id=1060627 Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read], Annual ACM Symposium on Theory of Computing

| doi = 10.1145/1060590.1060627

| pages = 244–250

| 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}}

[[Category:Boolean algebra]]