Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 06:09, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds on the multiplicative complexity of symmetric Boolean functions |
scientific article |
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
