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



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






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


Diskr. Mat., 2008, Volume 20, Issue 4, Pages 85–88 (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


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$.

DOI: https://doi.org/10.4213/dm1028

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

English version:
Discrete Mathematics and Applications, 2008, 18:5, 553–556

Bibliographic databases:

UDC: 519.7
Received: 15.06.2007

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://www.ams.org/mathscinet-getitem?mr=2500606}
\zmath{https://zbmath.org/?q=an:1172.94586}
\elib{http://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{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-57649221304}


Linking options:
  • http://mi.mathnet.ru/eng/dm1028
  • https://doi.org/10.4213/dm1028
  • http://mi.mathnet.ru/eng/dm/v20/i4/p85

    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. O. A. Logachev, “O znacheniyakh urovnya affinnosti dlya pochti vsekh bulevykh funktsii”, PDM, 2010, no. 3(9), 17–21  mathnet
  • Дискретная математика
    Number of views:
    This page:337
    Full text:87
    References:46
    First page:22

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