A 3n-lower bound on the network complexity of Boolean functions
- 1 January 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 10 (1) , 83-92
- https://doi.org/10.1016/0304-3975(80)90074-2
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- A $2.5n$-Lower Bound on the Combinational Complexity of Boolean FunctionsSIAM Journal on Computing, 1977
- On the combinational complexity of certain symmetric Boolean functionsTheory of Computing Systems, 1976
- The combinational complexity of equivalenceTheoretical Computer Science, 1976
- The network complexity and the Turing machine complexity of finite functionsActa Informatica, 1976
- Zwei lineare untere Schranken für die Komplexität Boolescher FunktionenComputing, 1974