A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions (Q4131019)
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 $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions |
scientific article; zbMATH DE number 3558984
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions |
scientific article; zbMATH DE number 3558984 |
Statements
A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions (English)
0 references
1977
0 references
