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, 2015, Volume 22, Issue 5, Pages 71–85
DOI: https://doi.org/10.17377/daio.2015.22.481 (Mi da829) 		 
This article is cited in 4 scientific papers (total in 4 papers)

Sufficient conditions for the minimal $\pi$-schemes for linear Boolean functions to be locally non-repeating

K. L. Rychkov

Sobolev Institute of Mathematics, 4 Koptyug Ave., 630090 Novosibirsk, Russia
Full-text PDF (293 kB) Citations (4)
References:
PDF
HTML
DOI: https://doi.org/10.17377/daio.2015.22.481
Abstract: We formulate sufficient conditions for the minimal $\pi$-schemes for linear Boolean functions to be locally non-repeating. The validity of these conditions gives a description of the classes of all minimal $\pi$-schemes for linear Boolean functions which depend essentially on n variables. Ill. 2, bibliogr. 12.
Keywords: formula size, $\pi$-scheme, lower bound on the complexity.
Received: 16.03.2015
Revised: 23.07.2015
English version:
Journal of Applied and Industrial Mathematics, 2015, Volume 9, Issue 4, Pages 580–587
DOI: https://doi.org/10.1134/S1990478915040146
Bibliographic databases:
Document Type: Article
UDC: 519.714
Language: Russian
Citation: K. L. Rychkov, “Sufficient conditions for the minimal $\pi$-schemes for linear Boolean functions to be locally non-repeating”, Diskretn. Anal. Issled. Oper., 22:5 (2015), 71–85; J. Appl. Industr. Math., 9:4 (2015), 580–587
Citation in format AMSBIB
\Bibitem{Ryc15}
\by K.~L.~Rychkov
\paper Sufficient conditions for the minimal $\pi$-schemes for linear Boolean functions to be locally non-repeating
\jour Diskretn. Anal. Issled. Oper.
\yr 2015
\vol 22
\issue 5
\pages 71--85
\mathnet{http://mi.mathnet.ru/da829}
\crossref{https://doi.org/10.17377/daio.2015.22.481}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3467240}
\elib{https://elibrary.ru/item.asp?id=24323030}
\transl
\jour J. Appl. Industr. Math.
\yr 2015
\vol 9
\issue 4
\pages 580--587
\crossref{https://doi.org/10.1134/S1990478915040146}
Linking options:
  • https://www.mathnet.ru/eng/da829
  • https://www.mathnet.ru/eng/da/v22/i5/p71
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:159
    Full-text PDF :65
    References:27
    First page:6
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024