Some remarks on Boolean sums
Neciporuk, Lamagna/Savage and Tarjan determined the monotone network complexity of a set of Boolean sums if any two sums have at most one variable in common. Wegener then solved the case that any two sums have at most k variables in common. We extend his methods and results and consider the case that any set of h+1 distinct sums have at most k variables in common. We use our general results to explicitly construct a set of n Boolean sums over n variables whose monotone complexity is of order n5/3. The best previously known bound was of order n3/2. Related results were obtained independently by Pippenger.
Unable to display preview. Download preview PDF.
- Brown, W.G.: On graphs that do not contain a Thompson graph. Can. Math. Bull, 9 (1966), pp. 281–285.Google Scholar
- Lamagna, E.A. / Savage, J.E.: Combinatorial complexity of some monotone functions, 15th SWAT Conference, New Orleans, 140–144, 1974.Google Scholar
- Mehlhorn, K. / Galil, Z.: Monotone switching circuits and Boolean matrix product, Computing 16, 99–111, 1976.Google Scholar
- Neciporuk, E.I.: On a Boolean matrix, Systems Research Theory, 21, 236–239, 1971.Google Scholar
- Pippenger, N.: On another boolean matrix, IBM Research Report 69/4, Dec. 1977.Google Scholar
- Wegener, I.: A new lower bound on the monotone network complexity of boolean sums, Preprint, Dept. of Mathematics, University of Bielefeld, 1978.Google Scholar