Matematicheskie Zametki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



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






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


Matematicheskie Zametki, 2021, Volume 109, Issue 2, Pages 257–263
DOI: https://doi.org/10.4213/mzm12691
(Mi mzm12691)
 

Asymptotics for the Complexity of Boolean Functions with Small Number of Ones

N. P. Red'kin

Lomonosov Moscow State University
References:
Abstract: The class $F_{n,k}$ of Boolean functions consisting of all functions of $n$ variables each of which outputs $1$ at exactly $k$ $n$-tuples of values of the variables is considered. For small $k$, for example, for $k<\ln n$, an asymptotics for the complexity of implementation of every function in $F_{n,k}$ by a circuit of functional elements in an irredundant basis containing $x\to y$ and $\overline{x\to y}$ is found.
Keywords: Boolean function, circuit, complexity of a function.
Funding agency Grant number
Russian Foundation for Basic Research 18-01-00337
This work was financially supported by the Russian Foundation for Basic Research under grant 18.01.00337 “Problems of synthesis, complexity, and reliability in the theory of control systems.”
Received: 05.02.2020
English version:
Mathematical Notes, 2021, Volume 109, Issue 2, Pages 256–261
DOI: https://doi.org/10.1134/S0001434621010296
Bibliographic databases:
Document Type: Article
UDC: 519.95
Language: Russian
Citation: N. P. Red'kin, “Asymptotics for the Complexity of Boolean Functions with Small Number of Ones”, Mat. Zametki, 109:2 (2021), 257–263; Math. Notes, 109:2 (2021), 256–261
Citation in format AMSBIB
\Bibitem{Red21}
\by N.~P.~Red'kin
\paper Asymptotics for the Complexity of Boolean Functions with Small Number of Ones
\jour Mat. Zametki
\yr 2021
\vol 109
\issue 2
\pages 257--263
\mathnet{http://mi.mathnet.ru/mzm12691}
\crossref{https://doi.org/10.4213/mzm12691}
\elib{https://elibrary.ru/item.asp?id=46880596}
\transl
\jour Math. Notes
\yr 2021
\vol 109
\issue 2
\pages 256--261
\crossref{https://doi.org/10.1134/S0001434621010296}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000670512900029}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85109786291}
Linking options:
  • https://www.mathnet.ru/eng/mzm12691
  • https://doi.org/10.4213/mzm12691
  • https://www.mathnet.ru/eng/mzm/v109/i2/p257
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Математические заметки Mathematical Notes
    Statistics & downloads:
    Abstract page:170
    Full-text PDF :32
    References:30
    First page:10
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024