A Boolean function requiring 3n network size
- 31 December 1983
- journal article
- research article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 28 (3), 337-345
- https://doi.org/10.1016/0304-3975(83)90029-4
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- ZeitschriftenreferateEuropean Journal of Wood and Wood Products, 1981
- A 3n-lower bound on the network complexity of Boolean functionsTheoretical Computer Science, 1980
- 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
- Zwei lineare untere Schranken für die Komplexität Boolescher FunktionenComputing, 1974