Skip to main content
SpringerLink
Log in

A method for obtaining efficient lower bounds for monotone complexity

  • Published:
Algebra and Logic Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Literature cited

  1. A. A. Markov, "On the minimal contact-valve two-terminal networks for monotone symmetric functions," Probl. Kibern.,8, 117–112 (1962).

    Google Scholar 

  2. E. I. Nechiporuk, "On a certain Boolean matrix," Probl. Kibern.,21, 237–240 (1969).

    Google Scholar 

  3. E. I. Nechiporuk, "On the realization of disjunction and conjunction in certain monotone bases," Probl. Kibern.,23, 291–293 (1970).

    Google Scholar 

  4. M. S. Paterson, "Complexity of monotone networks for Boolean matrix product," Theor. Comput. Sci.,1, 13–20 (1975).

    Google Scholar 

  5. V. R. Pratt, "The effect of basis on size of Boolean expressions," in: Proc. 16th Annual Symposium on Foundations of Computer Science (Berkeley, Calif., 1975), IEEE Computer Society, Long Beach, Calif. (1975), pp. 119–121.

    Google Scholar 

  6. N. Pippenger, On Another Boolean Matrix. IBM Research Report RC-6914 (1977).

  7. K. Mehlhorn and Z. Galil, "Monotone switching circuits and Boolean matrix product," Computing,16, 99–111 (1976).

    Google Scholar 

  8. K. Mehlhorn, "Some remarks on Boolean sums," Acta Inform.,12, 371–375 (1979).

    Google Scholar 

  9. I. Wegener, "Switching functions whose monotone complexity is nearly quadratic," Theor. Comput. Sci.,9, 83–97 (1979).

    Google Scholar 

  10. E. A. Okol'nishnikova, "A monotone Boolean system with quadratic complexity of realization in the basis {&, V,0, 1}," Diskretnyi Abaliz,41, 81–98 (1984).

    Google Scholar 

  11. A. E. Andreev, "On a method for obtaining lower bounds for the complexity of individual monotone functions," Preprint No. 248, Inst. Probl. Mekh. Akad. Nauk SSSR and Moskov. Gos. Univ. (1985).

  12. A. E. Andreev, "On a method for obtaining lower bounds for the complexity of individual monotone functions," Dokl. Akad. Nauk SSSR,282, No. 5, 1033–1037 (1985).

    Google Scholar 

  13. A. A. Razborov, "Lower bounds for the monotone complexity of certain Boolean functions," Dokl. Akad. Nauk SSSR,281, No. 4, 798–801 (1985).

    Google Scholar 

  14. A. A. Razborov, "Lower bounds on the monotone complexity of the logical permanent," Mat. Zametki,37, No. 6, 877–900 (1985).

    Google Scholar 

  15. O. B. Lupanov, "On the synthesis of certain classes of control systems," Probl. Kibern.,10, 63–97 (1963).

    Google Scholar 

  16. O. B. Lupanov, "On methods for obtaining estimates of the complexity of defining and computing individual functions," Diskretnyi Analiz, No. 25, 3–18 (1974).

  17. S. V. Yablonskii and O. B. Lupanov (eds.), Discrete Mathematics and Mathematical Questions of Cybernetics [in Russian], Nauka, Moscow (1974).

    Google Scholar 

Download references

Authors
  1. A. E. Andreev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 26, No. 1, pp. 3–26, January–February, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andreev, A.E. A method for obtaining efficient lower bounds for monotone complexity. Algebra and Logic 26, 1–18 (1987). https://doi.org/10.1007/BF01978380

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01978380

Keywords

Search

Navigation