Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 2018, Volume 25, Issue 3, Pages 36–94
DOI: https://doi.org/10.17377/daio.2018.25.589 (Mi da902) 		 
This article is cited in 3 scientific papers (total in 3 papers)

Complexity of the realization of a linear Boolean function in the class of $\pi$-schemes

K. L. Rychkov

Sobolev Institute of Mathematics, 4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
Full-text PDF (600 kB) Citations (3)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2018.25.589
Abstract: Using Khrapchenko's method, we obtain the exact lower bound of 40 for the complexity in the class of $\pi$-schemes of a linear Boolean function depending substantially on 6 variables. We give a simplified proof of several lower bounds for the complexity of linear Boolean functions which are previously obtained on the basis of the same method. Bibliogr. 18.
Keywords: Boolean function, $\pi$-scheme, lower complexity bound.
Funding agency Grant number
Russian Academy of Sciences - Federal Agency for Scientific Organizations I.1.1, 0314-2016-0001
The author was supported by the Program of Basic Scientific Research of the Siberian Branch of the Russian Academy of Sciences No. I.1.1 (project no. 0314-2016-0001).
Received: 18.09.2017
Revised: 10.05.2018
English version:
Journal of Applied and Industrial Mathematics, 2018, Volume 12, Issue 3, Pages 540–576
DOI: https://doi.org/10.1134/S1990478918030146
Bibliographic databases:
Document Type: Article
UDC: 519.714
Language: Russian
Citation: K. L. Rychkov, “Complexity of the realization of a linear Boolean function in the class of $\pi$-schemes”, Diskretn. Anal. Issled. Oper., 25:3 (2018), 36–94; J. Appl. Industr. Math., 12:3 (2018), 540–576
Citation in format AMSBIB
\Bibitem{Ryc18}
\by K.~L.~Rychkov
\paper Complexity of the realization of a~linear Boolean function in the class of $\pi$-schemes
\jour Diskretn. Anal. Issled. Oper.
\yr 2018
\vol 25
\issue 3
\pages 36--94
\mathnet{http://mi.mathnet.ru/da902}
\crossref{https://doi.org/10.17377/daio.2018.25.589}
\elib{https://elibrary.ru/item.asp?id=35448326}
\transl
\jour J. Appl. Industr. Math.
\yr 2018
\vol 12
\issue 3
\pages 540--576
\crossref{https://doi.org/10.1134/S1990478918030146}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85052123067}
Linking options:
  • https://www.mathnet.ru/eng/da902
  • https://www.mathnet.ru/eng/da/v25/i3/p36
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:216
    Full-text PDF :32
    References:30
    First page:4
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024