A 3n-lower bound on the network complexity of Boolean functions (Q1142030)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A 3n-lower bound on the network complexity of Boolean functions |
scientific article; zbMATH DE number 3684894
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 3n-lower bound on the network complexity of Boolean functions |
scientific article; zbMATH DE number 3684894 |
Statements
A 3n-lower bound on the network complexity of Boolean functions (English)
0 references
1980
0 references
network complexity
0 references
lowerbound
0 references
Boolean functions
0 references
unrestricted binary networks
0 references
