A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions (Q3361881): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0220032 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035917269 / rank | |||
Normal rank | |||
Latest revision as of 01:34, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions |
scientific article |
Statements
A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions (English)
0 references
1991
0 references
combinational complexity
0 references
lower bound
0 references
Boolean functions
0 references
