𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Symmetric and Threshold Boolean Functions Are Exhaustive

✍ Scribed by Moret, B.M.E.; Thomason, M.G.; Gonzalez, R.C.

Book ID
114606640
Publisher
IEEE
Year
1983
Tongue
English
Weight
446 KB
Volume
C-32
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Bent Boolean Functions That are S
On the Bent Boolean Functions That are Symmetric
✍ Peter SavickΓ½ πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 95 KB

Bent functions are the boolean functions having the maximal possible Hamming distance from the linear boolean functions. Bent functions were introduced and first studied by \(\mathrm{O}\). \(\mathrm{S}\). Rothaus in 1976 , We prove that there are exactly four symmetric bent functions on every even

Nontrivial monotone weakly symmetric Boo
Nontrivial monotone weakly symmetric Boolean functions with six variables are elusive
✍ Gao Sui-Xiang; Hu Xiao-Dong; Wu Weili πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 268 KB

A Boolean function \_/+I,. . ,x,,) is elusive if every decision tree evaluating f must examine all n variables in the worst case. Rivest and Vuillemin conjectured that every nontrivial monotone weakly symmetric Boolean function is elusive. In this note, we show that this conjecture is true for n = 6