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 3, Pages 73–79 (Mi dm1014)  

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

Asymptotic bounds for the affinity level for almost all Boolean functions

M. L. Buryakov


Abstract: We consider the asymptotic behaviour of one of the parameters of the Boolean functions known as the affinity level. We show that almost all Boolean functions of $n$ variables have the generalised affinity level exceeding $n-\alpha\log_2n$, $\alpha>1$, obtain an asymptotic upper bound for the partial affinity level, consider the asymptotic behaviour of the affinity level for the quadratic Boolean functions.

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

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

English version:
Discrete Mathematics and Applications, 2008, 18:5, 545–551

Bibliographic databases:

UDC: 519.7
Received: 10.06.2008

Citation: M. L. Buryakov, “Asymptotic bounds for the affinity level for almost all Boolean functions”, Diskr. Mat., 20:3 (2008), 73–79; Discrete Math. Appl., 18:5 (2008), 545–551

Citation in format AMSBIB
\Bibitem{Bur08}
\by M.~L.~Buryakov
\paper Asymptotic bounds for the affinity level for almost all Boolean functions
\jour Diskr. Mat.
\yr 2008
\vol 20
\issue 3
\pages 73--79
\mathnet{http://mi.mathnet.ru/dm1014}
\crossref{https://doi.org/10.4213/dm1014}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2467455}
\zmath{https://zbmath.org/?q=an:1172.94564}
\elib{http://elibrary.ru/item.asp?id=20730254}
\transl
\jour Discrete Math. Appl.
\yr 2008
\vol 18
\issue 5
\pages 545--551
\crossref{https://doi.org/10.1515/DMA.2008.039}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-57649219740}


Linking options:
  • http://mi.mathnet.ru/eng/dm1014
  • https://doi.org/10.4213/dm1014
  • http://mi.mathnet.ru/eng/dm/v20/i3/p73

    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
    2. A. V. Cheremushkin, “O raspredelenii ranga i otsenke urovnya affinnosti kvadratichnykh form”, PDM. Prilozhenie, 2016, no. 9, 36–38  mathnet  crossref
    3. A. V. Cheremushkin, “Estimating the level of affinity of a quadratic form”, Discrete Math. Appl., 27:6 (2017), 339–347  mathnet  crossref  crossref  isi  elib
    4. V. G. Ryabov, “O stepeni ogranichenii funktsii $q$-znachnoi logiki na lineinye mnogoobraziya”, PDM, 2019, no. 45, 13–25  mathnet  crossref
  • Дискретная математика
    Number of views:
    This page:372
    Full text:141
    References:40
    First page:14

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