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, Ser. 1, 2004, Volume 11, Issue 3, Pages 3–15 (Mi da108)  
This article is cited in 2 scientific papers (total in 2 papers)

On the mean complexity of Boolean functions defined by Zhegalkin polynomials

R. N. Zabaluev

M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (238 kB) Citations (2)
References:
PDF
HTML
Received: 15.04.2004
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: R. N. Zabaluev, “On the mean complexity of Boolean functions defined by Zhegalkin polynomials”, Diskretn. Anal. Issled. Oper., Ser. 1, 11:3 (2004), 3–15
Citation in format AMSBIB
\Bibitem{Zab04}
\by R.~N.~Zabaluev
\paper On the mean complexity of Boolean functions defined by Zhegalkin polynomials
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2004
\vol 11
\issue 3
\pages 3--15
\mathnet{http://mi.mathnet.ru/da108}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2109787}
Linking options:
  • https://www.mathnet.ru/eng/da108
  • https://www.mathnet.ru/eng/da/v11/s1/i3/p3
    • 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
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024