RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

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


Diskretn. Anal. Issled. Oper., Ser. 1, 2004, Volume 11, Number 4, Pages 68–80 (Mi da121)  

On the average monotone complexity of Boolean functions

A. V. Chashkin

M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics

Full text: PDF file (275 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.7
Received: 15.04.2004

Citation: A. V. Chashkin, “On the average monotone complexity of Boolean functions”, Diskretn. Anal. Issled. Oper., Ser. 1, 11:4 (2004), 68–80

Citation in format AMSBIB
\Bibitem{Cha04}
\by A.~V.~Chashkin
\paper On the average monotone complexity of Boolean functions
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2004
\vol 11
\issue 4
\pages 68--80
\mathnet{http://mi.mathnet.ru/da121}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2113072}


Linking options:
  • http://mi.mathnet.ru/eng/da121
  • http://mi.mathnet.ru/eng/da/v11/s1/i4/p68

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Дискретный анализ и исследование операций
    Number of views:
    This page:441
    Full text:153
    References:36

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020