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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 2003, Volume 15, Issue 4, Pages 100–112
DOI: https://doi.org/10.4213/dm218 (Mi dm218) 		 
This article is cited in 10 scientific papers (total in 10 papers)

On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis $\{x\to y,\bar x\}$

I. C. Shkrebela
Full-text PDF (665 kB) Citations (10)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm218
Abstract: We show that the minimal circuit of functional elements over the basis $\{x\to y,\bar x\}$ which realises a linear function of $n$ variables consists of $4n-4$ elements.
Received: 01.05.2002
English version:
Discrete Mathematics and Applications, 2003, Volume 13, Issue 5, Pages 483–496
DOI: https://doi.org/10.1515/156939203322694754
Bibliographic databases:
UDC: 519.95
Language: Russian
Citation: I. C. Shkrebela, “On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis $\{x\to y,\bar x\}$”, Diskr. Mat., 15:4 (2003), 100–112; Discrete Math. Appl., 13:5 (2003), 483–496
Citation in format AMSBIB
\Bibitem{Shk03}
\by I.~C.~Shkrebela
\paper On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis
$\{x\to y,\bar x\}$
\jour Diskr. Mat.
\yr 2003
\vol 15
\issue 4
\pages 100--112
\mathnet{http://mi.mathnet.ru/dm218}
\crossref{https://doi.org/10.4213/dm218}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2050751}
\zmath{https://zbmath.org/?q=an:1047.94517}
\transl
\jour Discrete Math. Appl.
\yr 2003
\vol 13
\issue 5
\pages 483--496
\crossref{https://doi.org/10.1515/156939203322694754}
Linking options:
  • https://www.mathnet.ru/eng/dm218
  • https://doi.org/10.4213/dm218
  • https://www.mathnet.ru/eng/dm/v15/i4/p100
    • This publication is cited in the following 10 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:495
    Full-text PDF :259
    References:32
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024