Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7199646
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on the multiplicative complexity of symmetric Boolean functions |
scientific article; zbMATH DE number 7199646 |
Statements
Upper bounds on the multiplicative complexity of symmetric Boolean functions (English)
0 references
12 May 2020
0 references
symmetric Boolean functions
0 references
multiplicative complexity
0 references
upper bounds
0 references
logic minimization
0 references
0 references
0.94043857
0 references
0.93991697
0 references
0.93473125
0 references
0.93380094
0 references
0.9319306
0 references
0.9308488
0 references
0.93062305
0 references
0.9291177
0 references
