Skip to main content
SpringerLink
Log in

Lower bounds on the size of bounded depth circuits over a complete basis with logical addition

  • 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.

Institutional subscriptions

Literature cited

  1. N. Blum, “Boolean functions requiring 3n network size,” Theor. Comput. Sci.,28, 337–345 (1984).

    Google Scholar 

  2. M. Furst, J. B. Saxe, and M. Sipser, “Parity, circuits, and the polynomial time hierarchy,” Proc. 22nd Ann. IEEE Symp. on Foundations of Computer Sci. (1981), pp. 260–270.

  3. M. Furst, J. B. Saxe, and M. Sipser, “Parity, circuits, and the polynomial time hierarchy,” Math. Syst. Theory,17, 13–27 (1984).

    Google Scholar 

  4. M. Ajtai, “Ϝ1 1 formulas on finite structures,” Ann. Pure Appl. Logic,24, 1–48 (1983).

    Google Scholar 

  5. L. G. Valiant, “Exponential lower bounds for restricted monotone circuits,” Proc. 15th Ann. ACM Symp. on Theory of Comp. (1983), pp. 110–187.

  6. R. Boppana, “Threshold functions and bounded depth monotone circuits,” Proc. 16th Ann. ACM Symp. on Theory of Comp. (1984), pp. 475–479.

  7. M. Klaw, W. Paul, N. Pippenger, and M. Yannakakis, “On monotone formulas with restricted depth,” Proc. 16th Ann. ACM Symp. on Theory of Comp. (1984), pp. 475–479.

  8. A. Yao, “Separating the polynomial-time hierarchy by oracles,” Proc. 26th Ann. IEEE Symp. on Foundations of Computer Science (1985), pp. 1–10.

  9. J. Hastad, “Almost-optimal lower bounds for small depth circuits,” Preprint (1985).

  10. A. A. Razborov, “Lower bounds on monotone complexity of some Boolean functions,” Dokl. Akad. Nauk SSSR,281, No. 4, 789–801 (1985).

    Google Scholar 

  11. A. A. Razborov, “Lower bounds on monotone complexity of a logical permanent,” Mat. Zametki,37, No. 6, 887–900 (1985).

    Google Scholar 

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

    Google Scholar 

  13. N. Alon and R. B. Boppana, “The monotone circuit complexity of Boolean functions,” Preprint (1985).

  14. D. Yu. Grigor'ev, “Lower bounds for algebraic complexity of computations,” Computational Complexity Theory, I [in Russian], Zapiski LOMI, Vol. 188, Nauka, Leningrad (1982).

    Google Scholar 

  15. A. A. Razborov, “Lower bounds on the size of bounded depth circuits over the basis { &, ∀, ⊕},” Usp. Math. Nauk,41, No.4, 219–220 (1986).

    Google Scholar 

  16. R. Smolensky, “Algebraic methods in the theory of lower bounds for Boolean circuit complexity,” Preprint, Univ. of California, Berkeley (1986).

    Google Scholar 

  17. M. Paterson, “Bounded depth circuits over {+, λ},” Preprint, Univ. of Warwick (1986).

Download references

Author information

Authors and Affiliations

  1. V. A. Steklov Mathematical Institute, 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. 41, No. 4, pp. 598–607, April, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Razborov, A.A. Lower bounds on the size of bounded depth circuits over a complete basis with logical addition. Mathematical Notes of the Academy of Sciences of the USSR 41, 333–338 (1987). https://doi.org/10.1007/BF01137685

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation