Skip to main content
SpringerLink
Log in

Upper bounds on the depth of symmetric Boolean functions

  • Published:
Moscow University Computational Mathematics and Cybernetics Aims and scope Submit manuscript

Abstract

A new method for implementing the counting function with Boolean circuits is proposed. It is based on modular arithmetic and allows us to derive new upper bounds for the depth of the majority function of n variables: 3.34log2 n over the basis B 2 of all binary Boolean functions and 4.87log2 n over the standard basis B 0 = {∧, ∨, −}. As a consequence, the depth of the multiplication of n-digit binary numbers does not exceed 4.34log2 n and 5.87log2 n over the bases B 2 and B 0, respectively. The depth of implementation of an arbitrary symmetric Boolean function of n variables is shown to obey the bounds 3.34log2 n and 4.88log2 n over the same bases.

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.

Similar content being viewed by others

References

  1. O. B. Lupanov, Asymptotic Estimates for the Complexity of Control Systems (Mosk. Gos. Univ., Moscow, 1984) [in Russian].

    Google Scholar 

  2. V. M. Khrapchenko, “Asymptotic estimation of addition time of a parallel adder,” Systems Theory Res., No. 19, 105–122 (1970).

    Google Scholar 

  3. V. M. Khrapchenko, “Some estimates for the multiplication time,” Probl. Kibern., No. 33, 221–227 (1978) [in Russian].

    Google Scholar 

  4. M. Paterson and U. Zwick, “Shallow circuits and concise formulae for multiple addition and multiplication,” Comput. Complexity 3, 262–291 (1993).

    Article  MathSciNet  MATH  Google Scholar 

  5. Grove E. PhD Thesis (Univ California, Berkeley, 1993).

  6. S. B. Gashkov, Entertaining Computer Arithmetic: Quick Algorithms of Operations with Numbers and Polynomials (Librokom, Moscow, 2012) [in Russian].

    Google Scholar 

  7. M.S. Paterson, N. Pippenger, and U. Zwick, “Faster circuits and shorter formulae for multiple addition, multi-plication and symmetric Boolean functions,” in Proc. 31st IEEE Symp. Found. Comput. Sci., St. Louis, Oct., 1990 (IEEE Computer Society, Washington, DC, 1990).

    Google Scholar 

  8. S. V. Yablonskii, Introduction to Discrete Mathematics (Vysshaya Shkola, Moscow, 2003) [in Russian].

    Google Scholar 

  9. E. Demenkov, A. Kojevnikov, A. Kulikov, and G. Yaroslavtsev, “New upper bounds on the Boolean circuit complexity of symmetric functions,” Inf. Proc. Lett. 110(7), 264–267 (2010).

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mechanics and Mathematics, Moscow State University, Moscow, 119991, Russia

    I. S. Sergeev

Authors
  1. I. S. Sergeev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. S. Sergeev.

Additional information

Original Russian Text © I.S. Sergeev, 2013, published in Vestnik Moskovskogo Universiteta. Vychislitel’naya Matematika i Kibernetika, 2013, No. 4, pp. 39–44.

About this article

Cite this article

Sergeev, I.S. Upper bounds on the depth of symmetric Boolean functions. MoscowUniv.Comput.Math.Cybern. 37, 195–201 (2013). https://doi.org/10.3103/S0278641913040080

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0278641913040080

Keywords

Search

Navigation