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, 2018, Volume 30, Issue 4, Pages 88–96
DOI: https://doi.org/10.4213/dm1513 (Mi dm1513) 		 
This article is cited in 1 scientific paper (total in 1 paper)

The generalized complexity of linear Boolean functions

N. P. Red'kin

Lomonosov Moscow State University
Full-text PDF (165 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1513
Funding agency Grant number
Russian Foundation for Basic Research 18.01.00337
Received: 03.04.2018
Bibliographic databases:
Document Type: Article
UDC: 519.714.4
Language: Russian
Citation: N. P. Red'kin, “The generalized complexity of linear Boolean functions”, Diskr. Mat., 30:4 (2018), 88–96
Citation in format AMSBIB
\Bibitem{Red18}
\by N.~P.~Red'kin
\paper The generalized complexity of linear Boolean functions
\jour Diskr. Mat.
\yr 2018
\vol 30
\issue 4
\pages 88--96
\mathnet{http://mi.mathnet.ru/dm1513}
\crossref{https://doi.org/10.4213/dm1513}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3884630}
\elib{https://elibrary.ru/item.asp?id=36447994}
Linking options:
  • https://www.mathnet.ru/eng/dm1513
  • https://doi.org/10.4213/dm1513
  • https://www.mathnet.ru/eng/dm/v30/i4/p88
    • 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
    		Дискретная математика
    Statistics & downloads:
    Abstract page:362
    Full-text PDF :87
    References:49
    First page:22
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024