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, 2011, Volume 23, Issue 4, Pages 80–102
DOI: https://doi.org/10.4213/dm1163
(Mi dm1163)
 

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

The best asymptotic representation of Boolean functions by information graphs

Yu. S. Shutkin
References:
Received: 25.06.2010
English version:
Discrete Mathematics and Applications, 2011, Volume 21, Issue 5-6, Pages 675–700
DOI: https://doi.org/10.1515/dma.2011.040
Bibliographic databases:
Document Type: Article
UDC: 519.7
Language: Russian
Citation: Yu. S. Shutkin, “The best asymptotic representation of Boolean functions by information graphs”, Diskr. Mat., 23:4 (2011), 80–102; Discrete Math. Appl., 21:5-6 (2011), 675–700
Citation in format AMSBIB
\Bibitem{Shu11}
\by Yu.~S.~Shutkin
\paper The best asymptotic representation of Boolean functions by information graphs
\jour Diskr. Mat.
\yr 2011
\vol 23
\issue 4
\pages 80--102
\mathnet{http://mi.mathnet.ru/dm1163}
\crossref{https://doi.org/10.4213/dm1163}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=2933101}
\elib{https://elibrary.ru/item.asp?id=20730406}
\transl
\jour Discrete Math. Appl.
\yr 2011
\vol 21
\issue 5-6
\pages 675--700
\crossref{https://doi.org/10.1515/dma.2011.040}
Linking options:
  • https://www.mathnet.ru/eng/dm1163
  • https://doi.org/10.4213/dm1163
  • https://www.mathnet.ru/eng/dm/v23/i4/p80
  • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Дискретная математика
    Statistics & downloads:
    Abstract page:486
    Full-text PDF :247
    References:82
    First page:20
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025