Boolean functions whose monotone complexity is of size n2/log n

  • Ingo Wegener
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 104)


We construct a sequence of monotone Boolean functions hn:{0, 1}n→{0, 1}n, such that the monotone complexity of hn is of order n2/log n. This result includes the largest known lower bound of this kind. Previously there were an Ω(n3/2) bound for the Boolean matrix product, an Ω(n5/3) bound for Boolean sums and an Ω(n2/log2n) bound of the author for the same functions hn. This new lower bound is proved by new methods which probably will turn out to be useful also for other problems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [1]
    E. A. Lamagna/J.E. Savage: Combinational complexity of some monotone functions, 15th SWAT Conference, New Orleans, 140–144, 1974.Google Scholar
  2. [2]
    K. Mehlhorn: Some remarks on Boolean sums, Acta Informatica 12, 371–375, 1979.CrossRefGoogle Scholar
  3. [3]
    K. Mehlhorn/Z. Galil: Monotone switching circuits and Boolean matrix product, Computing 16, 99–111, 1976.CrossRefGoogle Scholar
  4. [4]
    E.I. Neciporok: On a Boolean matrix, Systems Research Theory 21, 236–239, 1971.Google Scholar
  5. [5]
    M.S. Paterson: Complexity of monotone networks for Boolean matrix product, Theoretical Computer Science 1, 13–20, 1975.CrossRefGoogle Scholar
  6. [6]
    N. Pippenger: On another Boolean matrix, IBM Research Report 6914, 1977.Google Scholar
  7. [7]
    N. Pippenger/L.G. Valiant: Shifting graphs and their applications, Journal of the ACM 23, 423–432, 1976.CrossRefGoogle Scholar
  8. [8]
    V.R. Pratt: The power of negative thinking in multiplying Boolean matrices, SIAM J. on Computing 4, 326–330, 1975.CrossRefGoogle Scholar
  9. [9]
    R.E. Tarjan: Complexity of monotone networks for computing conjunctions, Ann. Discrete Mathematics 2, 121–133, 1978.Google Scholar
  10. [10]
    I. Wegener: Switching functions whose monotone complexity is nearly quadratic, Theoretical Computer Science 9, 83–97, 1979.CrossRefGoogle Scholar
  11. [11]
    I. Wegener: A new lower bound on the monotone network complexity of Boolean sums, Acta Informatica 13, 109–114, 1980.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Ingo Wegener
    • 1
  1. 1.Fakultät für MathematikUniversität BielefeldBielefeld 1Germany

Personalised recommendations