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, 2008, Volume 20, Issue 4, Pages 29–41
DOI: https://doi.org/10.4213/dm1024 (Mi dm1024) 		 
This article is cited in 2 scientific papers (total in 2 papers)

On the realisation of Boolean functions by informational graphs

Yu. S. Shutkin
Full-text PDF (179 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1024
Abstract: We consider the problem on the realisation of Boolean functions by informational graphs. The exact expression of the Shannon function for the realisation in the class of tree-like informational graphs is obtained. For almost all Boolean functions, we obtain the order of the complexity of the realisation by informational graphs and the asymptotics of complexity of the realisation by informational trees.
Received: 07.12.2006
English version:
Discrete Mathematics and Applications, 2008, Volume 18, Issue 6, Pages 581–593
DOI: https://doi.org/10.1515/DMA.2008.044
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: Yu. S. Shutkin, “On the realisation of Boolean functions by informational graphs”, Diskr. Mat., 20:4 (2008), 29–41; Discrete Math. Appl., 18:6 (2008), 581–593
Citation in format AMSBIB
\Bibitem{Shu08}
\by Yu.~S.~Shutkin
\paper On the realisation of Boolean functions by informational graphs
\jour Diskr. Mat.
\yr 2008
\vol 20
\issue 4
\pages 29--41
\mathnet{http://mi.mathnet.ru/dm1024}
\crossref{https://doi.org/10.4213/dm1024}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2500602}
\zmath{https://zbmath.org/?q=an:1180.94095}
\elib{https://elibrary.ru/item.asp?id=20730264}
\transl
\jour Discrete Math. Appl.
\yr 2008
\vol 18
\issue 6
\pages 581--593
\crossref{https://doi.org/10.1515/DMA.2008.044}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-57349141968}
Linking options:
  • https://www.mathnet.ru/eng/dm1024
  • https://doi.org/10.4213/dm1024
  • https://www.mathnet.ru/eng/dm/v20/i4/p29
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:610
    Full-text PDF :256
    References:79
    First page:44
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024