A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions
- 1 September 1977
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 6 (3) , 427-443
- https://doi.org/10.1137/0206030
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Computational Work and Time on Finite MachinesJournal of the ACM, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Berechnung und programm. IActa Informatica, 1972