Skip to main content
SpringerLink
Log in

A Circuit of Depth Two with Limited Input Branching for Majority Functions

  • Brief Communications
  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

It is shown that a majority Boolean function of n variables can be computed by a depth–2 circuit consisting of majority gates with fan–in n–2 (for each оdd n greater than 5).

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

References

  1. A. S. Kulikov and V. V. Podolskii, “Computing Majority by Constant Depth Majority Circuits with Low Fari–iri Gates,” in 34th Symp. on Theoretical Aspects of Computer Science (STACS 2017), 2017, pp. 49:1–49:14.

    Google Scholar 

  2. C. Engels, M. Grag, K. Makirio, and A. Rao, “On Expressing Majority as Majority of Majorities,” Electronic Colloquium on Computational Complexity. TRI 7–174.

  3. A. B Ugol'nikov, Posies Glasses (Moscow State Univ., Mech. Math. Faculty, Moscow, 2008) [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Yu. A. Kombarov

Authors
  1. Yu. A. Kombarov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu. A. Kombarov.

Additional information

Original Russian Text © Yu.A. Kombarov, 2018, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2018, Vol. 73, No. 5, pp. 58–60.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kombarov, Y.A. A Circuit of Depth Two with Limited Input Branching for Majority Functions. Moscow Univ. Math. Bull. 73, 196–198 (2018). https://doi.org/10.3103/S0027132218050054

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Search

Navigation