𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The circuit depth of symmetric boolean functions

✍ Scribed by William F. McColl

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
354 KB
Volume
17
Category
Article
ISSN
0022-0000

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

Variable orderings and the size of OBDDs
Variable orderings and the size of OBDDs for random partially symmetric Boolean functions
✍ Detlef Sieling πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 268 KB πŸ‘ 3 views

The size of ordered binary decision diagrams OBDDs strongly depends on the chosen variable ordering. It is an obvious heuristic to use symmetric variable orderings, i.e., variable orderings where symmetric variables are arranged adjacently. In order to evaluate this heuristic, methods for estimating