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, 1993, Volume 331, Number 5, Pages 533–535 (Mi dan5086)  
MATHEMATICS

Complexity and the coding of Boolean functions

A. E. Andreev

Volgograd State University
Full-text PDF (288 kB)
Presented: V. A. Il'in
Received: 11.02.1993
Bibliographic databases:
Document Type: Article
UDC: 519.4
Language: Russian
Citation: A. E. Andreev, “Complexity and the coding of Boolean functions”, Dokl. Akad. Nauk, 331:5 (1993), 533–535; Dokl. Math., 48:1 (1994), 122–126
Citation in format AMSBIB
\Bibitem{And93}
\by A.~E.~Andreev
\paper Complexity and the coding of Boolean functions
\jour Dokl. Akad. Nauk
\yr 1993
\vol 331
\issue 5
\pages 533--535
\mathnet{http://mi.mathnet.ru/dan5086}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1258208}
\zmath{https://zbmath.org/?q=an:0817.94031}
\transl
\jour Dokl. Math.
\yr 1994
\vol 48
\issue 1
\pages 122--126
Linking options:
  • https://www.mathnet.ru/eng/dan5086
  • https://www.mathnet.ru/eng/dan/v331/i5/p533
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:90
    Full-text PDF :42
    References:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024