RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2012, Volume 19, Number 3, Pages 39–57 (Mi da689)  

This article is cited in 5 scientific papers (total in 5 papers)

On minimal realizations of linear Boolean functions

Yu. A. Kombarov

M. V. Lomonosov Moscow State University, Moscow, Russia

Abstract: The article deals with the realization of linear Boolean functions by circuits of functional elements in the classical basis (conjunction, disjunction, and negation). It is established that all minimal circuits realizing linear functions in this basis have a block structure. Ill. 10, bibliogr. 10.

Keywords: circuit of functional elements, linear Boolean function, minimal circuit, standard block, standard reduction.

Full text: PDF file (339 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.95
Received: 28.06.2011
Revised: 18.08.2011

Citation: Yu. A. Kombarov, “On minimal realizations of linear Boolean functions”, Diskretn. Anal. Issled. Oper., 19:3 (2012), 39–57

Citation in format AMSBIB
\Bibitem{Kom12}
\by Yu.~A.~Kombarov
\paper On minimal realizations of linear Boolean functions
\jour Diskretn. Anal. Issled. Oper.
\yr 2012
\vol 19
\issue 3
\pages 39--57
\mathnet{http://mi.mathnet.ru/da689}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2986640}


Linking options:
  • http://mi.mathnet.ru/eng/da689
  • http://mi.mathnet.ru/eng/da/v19/i3/p39

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Yu. A. Kombarov, “On minimal circuits for linear functions over some bases”, Discrete Math. Appl., 23:1 (2013), 39–51  mathnet  crossref  crossref  mathscinet  elib
    2. Yu. A. Kombarov, “O minimalnykh skhemakh v bazise Sheffera dlya lineinykh bulevykh funktsii”, Diskretn. analiz i issled. oper., 20:4 (2013), 65–87  mathnet  mathscinet
    3. Yu. A. Kombarov, “Complexity and structure of circuits for parity functions”, J. Math. Sci., 233:1 (2018), 95–99  mathnet  crossref
    4. Yu. A. Kombarov, “Upper estimate of realization complexity of linear functions in a basis consisting of multi-input elements”, Moscow University Mathematics Bulletin, 70:5 (2015), 226–229  mathnet  crossref  mathscinet  isi
    5. N. P. Redkin, “Obobschennaya slozhnost lineinykh bulevykh funktsii”, Diskret. matem., 30:4 (2018), 88–95  mathnet  crossref  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:277
    Full text:67
    References:27
    First page:7

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020