This is a preview of subscription content, log in via an institution to check access.
Literature cited
I. Wegener, “Switching functions whose monotone complexity is nearly quadratic,” Theor. Comput. Sci.,9, No. 1, 83–97 (1979).
I. Wegener, “A new lower bound on the monotone network complexity of Boolean sums,” Acta Inf.,13, 109–114 (1980).
I. Wegener, “Boolean functions whose monotone complexity is of size n2/log n,” Theor. Comput. Sci.,21, 213–224 (1982).
A. A. Razborov, “Lower bound on monotone complexity of some Boolean functions,” Dokl. Akad. Nauk SSSR,281, No. 4, 798–801 (1985).
P. Erdos and J. Spencer, Probabilistic Methods in Combinatorics [Russian translation], Mir, Moscow (1976).
J. E. Hopcroft and R. M. Karp, “An n5/2 algorithm for maximum matching in bipartite graphs,” SIAM J. Comput.,2, 225–231 (1973).
V. R. Pratt, “The power of negative thinking in multiplying Boolean matrices,” SIAM J. Comput.,4, 326–330 (1975).
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 37, No. 6, pp. 887–900, June, 1985.
Rights and permissions
About this article
Cite this article
Razborov, A.A. Lower bounds on monotone complexity of the logical permanent. Mathematical Notes of the Academy of Sciences of the USSR 37, 485–493 (1985). https://doi.org/10.1007/BF01157687
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01157687