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 85–88
DOI: https://doi.org/10.4213/dm1028 (Mi dm1028) 		 
This article is cited in 1 scientific paper (total in 1 paper)

A lower bound for the affinity level for almost all Boolean functions

O. A. Logachev
Full-text PDF (83 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1028
Abstract: We consider the behaviour of the affinity level of the Boolean functions. It is shown that, as $n\to\infty$, almost all Boolean functions of $n$ variables have the affinity level exceeding $n-2\log_2n$.
Received: 15.06.2007
English version:
Discrete Mathematics and Applications, 2008, Volume 18, Issue 5, Pages 553–556
DOI: https://doi.org/10.1515/DMA.2008.040
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: O. A. Logachev, “A lower bound for the affinity level for almost all Boolean functions”, Diskr. Mat., 20:4 (2008), 85–88; Discrete Math. Appl., 18:5 (2008), 553–556
Citation in format AMSBIB
\Bibitem{Log08}
\by O.~A.~Logachev
\paper A lower bound for the affinity level for almost all Boolean functions
\jour Diskr. Mat.
\yr 2008
\vol 20
\issue 4
\pages 85--88
\mathnet{http://mi.mathnet.ru/dm1028}
\crossref{https://doi.org/10.4213/dm1028}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2500606}
\zmath{https://zbmath.org/?q=an:1172.94586}
\elib{https://elibrary.ru/item.asp?id=20730268}
\transl
\jour Discrete Math. Appl.
\yr 2008
\vol 18
\issue 5
\pages 553--556
\crossref{https://doi.org/10.1515/DMA.2008.040}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-57649221304}
Linking options:
  • https://www.mathnet.ru/eng/dm1028
  • https://doi.org/10.4213/dm1028
  • https://www.mathnet.ru/eng/dm/v20/i4/p85
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:550
    Full-text PDF :155
    References:75
    First page:22
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024