Upper bounds on the multiplicative complexity of symmetric Boolean functions (Q2179499): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q89966425, #quickstatements; #temporary_batch_1707252663060 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q89966425 / rank | |||
Normal rank | |||
Revision as of 01:33, 7 February 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
