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, 2020, Volume 32, Issue 3, Pages 130–134
DOI: https://doi.org/10.4213/dm1593 (Mi dm1593) 		 
This article is cited in 1 scientific paper (total in 1 paper)

On the average-case complexity of Boolean functions under binomial distribution on their domains

A. V. Chashkin

Lomonosov Moscow State University
Full-text PDF (370 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1593
Abstract: Given a binomial probability distribution on the $n$-dimensional Boolean cube, the complexity of implementation of Boolean functions by straight line programs with conditional stop is considered. The order, as $n\to\infty$, of the average-case complexity of almost all $n$-place Boolean functions is established.
Keywords: Boolean functions, binomial distribution, average-case complexity.
Funding agency Grant number
Russian Foundation for Basic Research 18-01-00337
Received: 08.10.2019
English version:
Discrete Mathematics and Applications, 2021, Volume 31, Issue 5, Pages 315–318
DOI: https://doi.org/10.1515/dma-2021-0028
Bibliographic databases:
Document Type: Article
UDC: 519.714.4
Language: Russian
Citation: A. V. Chashkin, “On the average-case complexity of Boolean functions under binomial distribution on their domains”, Diskr. Mat., 32:3 (2020), 130–134; Discrete Math. Appl., 31:5 (2021), 315–318
Citation in format AMSBIB
\Bibitem{Cha20}
\by A.~V.~Chashkin
\paper On the average-case complexity of Boolean functions under binomial distribution on their domains
\jour Diskr. Mat.
\yr 2020
\vol 32
\issue 3
\pages 130--134
\mathnet{http://mi.mathnet.ru/dm1593}
\crossref{https://doi.org/10.4213/dm1593}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4147023}
\elib{https://elibrary.ru/item.asp?id=47517289}
\transl
\jour Discrete Math. Appl.
\yr 2021
\vol 31
\issue 5
\pages 315--318
\crossref{https://doi.org/10.1515/dma-2021-0028}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000708435200002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85117696518}
Linking options:
  • https://www.mathnet.ru/eng/dm1593
  • https://doi.org/10.4213/dm1593
  • https://www.mathnet.ru/eng/dm/v32/i3/p130
    • 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
    		Дискретная математика
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024