A new lower bound on the monotone network complexity of Boolean sums
- 1 February 1980
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 13 (2) , 109-114
- https://doi.org/10.1007/bf00263988
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Switching functions whose monotone complexity is nearly quadraticTheoretical Computer Science, 1979
- Monotone switching circuits and boolean matrix productComputing, 1976
- Combinational complexity of some monotone functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1974
- An Algorithm for the Computation of Linear FormsSIAM Journal on Computing, 1974