Summary
Neciporuk [3], Lamagna/Savage [1] and Tarjan [6] determined the monotone network complexity of a set of Boolean sums if each two sums have at most one variable in common. By this result they could define explicitely a set of n Boolean sums which depend on n variables and whose monotone complexity is of order n 3/2. In the main theorem of this paper we prove a more general lower bound on the monotone network complexity of Boolean sums. Our lower bound is for many Boolean sums the first nontrivial lower bound. On the other side we can prove that the best lower bound which the main theorem yields is the n 3/2-bound cited above. For the proof we use the technical trick of assuming that certain functions are given for free.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Lamagna, E.A., Savage, J.E.: Combinational complexity of some monotone functions. 15th SWAT Conference, New Orleans, pp 140–144, 1974
Mehlhorn, K., Galil, Z.: Monotone switching circuits and Boolean matrix product. Computing 16, 99–111 (1976)
Neciporuk, E.I.: On a Boolean matrix. Systems Research Theory 21, 236–239 (1971)
Pippenger, N.: On another Boolean matrix. IBM Research Report RC 6914, 1977
Savage, J.E.: An algorithm for the computation of linear forms. SIAM J. Comput. 3, 150–158 (1974)
Tarjan, R.E.: Complexity of monotone networks for computing conjunctions. Preprint, Computer Science Department, Stanford University
Wegener, I.: Switching functions whose monotone complexity is nearly quadratic. Theor. Comput. Sci. 9 (in press 1979)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wegener, I. A new lower bound on the monotone network complexity of Boolean sums. Acta Informatica 13, 109–114 (1980). https://doi.org/10.1007/BF00263988
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF00263988