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, 2016, Volume 28, Issue 2, Pages 146–153
DOI: https://doi.org/10.4213/dm1377 (Mi dm1377) 		 
This article is cited in 2 scientific papers (total in 2 papers)

Bounds for the average-case complexity of monotone Boolean functions

A. V. Chashkin

Lomonosov Moscow State University
Full-text PDF (533 kB) Citations (2)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1377
Abstract: We consider average-case complexity of computing monotone Boolean functions by straight-line programs with a conditional stop over the basis of all Boolean functions of at most two variables. For the set of all $n$-ary monotone Boolean functions new Shannon-type upper and lower bounds for the average-case complexity as $n\to\infty$ are established.
Keywords: monotone Boolean functions, average-case complexity.
Funding agency Grant number
Russian Foundation for Basic Research 14-01-00598
This work was supported by the Russian Foundation for Basic Research, project no. 14-01-00598.
Received: 18.01.2016
English version:
Discrete Mathematics and Applications, 2017, Volume 27, Issue 3, Pages 137–142
DOI: https://doi.org/10.1515/dma-2017-0017
Bibliographic databases:
Document Type: Article
UDC: 519.714.4
Language: Russian
Citation: A. V. Chashkin, “Bounds for the average-case complexity of monotone Boolean functions”, Diskr. Mat., 28:2 (2016), 146–153; Discrete Math. Appl., 27:3 (2017), 137–142
Citation in format AMSBIB
\Bibitem{Cha16}
\by A.~V.~Chashkin
\paper Bounds for the average-case complexity of monotone Boolean functions
\jour Diskr. Mat.
\yr 2016
\vol 28
\issue 2
\pages 146--153
\mathnet{http://mi.mathnet.ru/dm1377}
\crossref{https://doi.org/10.4213/dm1377}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3559800}
\elib{https://elibrary.ru/item.asp?id=26414211}
\transl
\jour Discrete Math. Appl.
\yr 2017
\vol 27
\issue 3
\pages 137--142
\crossref{https://doi.org/10.1515/dma-2017-0017}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000405964800001}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85021782660}
Linking options:
  • https://www.mathnet.ru/eng/dm1377
  • https://doi.org/10.4213/dm1377
  • https://www.mathnet.ru/eng/dm/v28/i2/p146
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:316
    Full-text PDF :52
    References:34
    First page:26
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024