Doklady Akademii Nauk
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Doklady Akademii Nauk, 1996, Volume 350, Number 1, Pages 22–24 (Mi dan4018)  
MATHEMATICS

Bounds for the depth of decision trees that compute Boolean functions

M. Yu. Moshkov

Research Institute for Applied Mathematics and Cybernetics, N. I. Lobachevski State University of Nizhnii Novgorod
Full-text PDF (252 kB)
Presented: Yu. I. Zhuravlev
Received: 07.12.1994
Bibliographic databases:
Document Type: Article
UDC: 519.95
Language: Russian
Citation: M. Yu. Moshkov, “Bounds for the depth of decision trees that compute Boolean functions”, Dokl. Akad. Nauk, 350:1 (1996), 22–24
Citation in format AMSBIB
\Bibitem{Mos96}
\by M.~Yu.~Moshkov
\paper Bounds for the depth of decision trees that compute Boolean
functions
\jour Dokl. Akad. Nauk
\yr 1996
\vol 350
\issue 1
\pages 22--24
\mathnet{http://mi.mathnet.ru/dan4018}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1444212}
\zmath{https://zbmath.org/?q=an:0893.06003}
Linking options:
  • https://www.mathnet.ru/eng/dan4018
  • https://www.mathnet.ru/eng/dan/v350/i1/p22
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:98
    Full-text PDF :52
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024