Skip to main content
SpringerLink
Log in

Complexity of realization of a linear Boolean function in Sheffer’s basis

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

Abstract

The paper is focused on realization of linear Boolean functions by circuits of functional elements in the basis

, which is the Sheffer stroke. The exact value of complexity of negation of linear function is obtained in this paper. Another result is the description of all minimal circuits realizing a linear function.

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. S. V. Yablonskii, Introduction to Discrete Mathematics (Nauka, Moscow, 1986) [in Russian].

    Google Scholar 

  2. C. Cardot, “Quelques rézultats sur l’application de l’algébre de Boole á la synthése des circuits á relais,” Ann. Télécommun. 7(2), 75 (1952).

    MathSciNet  Google Scholar 

  3. O. B. Lupanov, Asymptotic Complexity Estimates of Control Systems (Moscow State Univ., Moscow, 1984) [in Russian].

    Google Scholar 

  4. N. P. Red’kin, “Proof of the Minimality of Some Circuits of Functional Elements,” Problemy Kibern. 23, 83 (1970).

    MathSciNet  MATH  Google Scholar 

  5. Yu. A. Kombarov, “Minimal Realizations of Linear Boolean Functions by Circuits of Functional Elements in the Basis ,” in Proc. VIII Int. Conf. “Discrete Models in the Theory of Control Systems,” (Moscow, April 6–9 2009) (MAKS Press, Moscow, 2009), pp. 145–149.

    Google Scholar 

  6. N. P. Red’kin, “Minimal Realization of a Linear Function by a Circuit of Functional Elements,” Kibernetika 6, 31 (1971).

    MathSciNet  Google Scholar 

  7. I. S. Shkrebela, “Complexity of Realization of Linear Boolean Functions by Circuits of Functional Elements in the Basis \(\{ x \to y,\bar x\} \),” Diskretn. Matem. 15(4), 100 (2003).

    Article  MathSciNet  Google Scholar 

  8. Yu. A. Kombarov, “Minimal Circuits for Linear Boolean Functions,” Vestn, Mosk, Univ., Matem. Mekhan., No. 6, 41 (2011).

    Google Scholar 

  9. N. P. Red’kin, “Minimal and Asymptotically Minimal Circuits for Some Individual Boolean Functions,” in Proc. IX Int. Seminar “Discrete Mathematics and its Applications” dedicated to 75th anniv. of Acad. O. B. Lupanov (Moscow, June 18–23, 2007) (Moscow State Univ., Moscow, 2007), pp. 11–19.

    Google Scholar 

  10. N. P. Red’kin, “Minimal Realization of a Binary Summator,” Problemy Kibern. 38, 181 (1981).

    MathSciNet  MATH  Google Scholar 

  11. N. P. Red’kin, Discrete Mathematics (Fizmatlit, Moscow, 2009) [in Russian].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mechanics and Mathematics, Moscow State University, Leninskie Gory, 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

Additional information

Original Russian Text © Yu.A.Kombarov, 2013, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2013, Vol. 67, No. 2, pp. 49–53.

About this article

Cite this article

Kombarov, Y.A. Complexity of realization of a linear Boolean function in Sheffer’s basis. Moscow Univ. Math. Bull. 68, 114–117 (2013). https://doi.org/10.3103/S0027132213020083

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation