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, 1997, Volume 4, Issue 3, Pages 69–80 (Mi da402)  
This article is cited in 2 scientific papers (total in 2 papers)

Local complexity of Boolean functions

A. V. Chashkin

M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (1125 kB) Citations (2)
Received: 28.04.1997
Bibliographic databases:
Language: Russian
Citation: A. V. Chashkin, “Local complexity of Boolean functions”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:3 (1997), 69–80
Citation in format AMSBIB
\Bibitem{Cha97}
\by A.~V.~Chashkin
\paper Local complexity of Boolean functions
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 1997
\vol 4
\issue 3
\pages 69--80
\mathnet{http://mi.mathnet.ru/da402}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1490455}
\zmath{https://zbmath.org/?q=an:1028.68062}
Linking options:
  • https://www.mathnet.ru/eng/da402
  • https://www.mathnet.ru/eng/da/v4/s1/i3/p69
    • 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
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:260
    Full-text PDF :116
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024