Skip to main content
SpringerLink
Log in

Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits

  • Published:
Mathematical notes of the Academy of Sciences of the USSR Aims and scope Submit manuscript

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.

Literature cited

  1. P. Pudlak, “The hierarchy of Boolean circuits,” Comput. Art. Intel.,6, No. 5, 449–468 (1987).

    Google Scholar 

  2. A. A. Markov, “On minimal contact-rectifier bipolar circuits for monotone symmetric functions,” Probl. Kibern., No. 8, 117–121 (1962).

    Google Scholar 

  3. E. I. Nechiporuk, “On a boolean function,” Dokl. Akad. Nauk SSSR,169, No. 4, 765–766 (1966).

    Google Scholar 

  4. A. Borodin, D. Dolev, F. E. Fich, and W. Paul, “Bounds for width 2 branching programs,” Proc. 15th ACM STOC (1983), pp. 87–93.

  5. A. K. Chandra, M. L. Fürst, and R. J. Lipton, “Multiparty protocols,” Proc. 15th ACM STOC (1983), pp. 94–99.

  6. A. C. Yao, “Lower bounds by probabilistic arguments,” Proc. 24th IEEE FOCS (1983), pp. 420–428.

  7. P. Pudlak, “A lower bound on complexity of branching programs,” Proc. 11th Symposium on Mathematical Foundations of Computer Science (1984), Lecture Notes in Computer Science (1984), Vol. 176.

  8. M. Ajtai, L. Babai, P. Hajnal, J. Komlos, P. Pudlak, V. Rodl, E. Szemeredi, and Gy Turan, “Two lower bounds for branching programs,” Proc. 18th ACM STOC (1986), pp. 30–38.

  9. N. Alon and W. M. Maass, “Ramsey theory and lower bounds for branching programs,” Proc. 27th IEEE FOCS (1986), pp. 410–417.

  10. L. Babai, P. Pudlak, V. Rodl, and E. Szemeredi, “Lower bounds to the complexity of symmetric Boolean functions,” preprint.

  11. M. I. Grinchuk, On the Complexity of Realization of Symmetric Boolean Functions by Contact Circuits [in Russian], Dissertation for the Degree of Candidate in Mathematical Physics, Moscow (1989).

  12. A. A. Razborov, “On the method of approximations,” Proc. 21st ACM STOC (1989), pp. 167–176.

  13. R. L. Graham, B. L. Rothschild, and J. H. Spencer, Ramsey Theory, New York, Wiley (1980).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Steklov Institute of Mathematics, Academy of Sciences of the USSR, USSR

    A. A. Razborov

Authors
  1. A. A. Razborov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Matematicheskie Zametki, Vol. 48, No. 6, pp. 79–90, December, 1990.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Razborov, A.A. Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits. Mathematical Notes of the Academy of Sciences of the USSR 48, 1226–1234 (1990). https://doi.org/10.1007/BF01240265

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation