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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 1989, Volume 1, Issue 4, Pages 36–45 (Mi dm939)  
This article is cited in 4 scientific papers (total in 4 papers)

The complexity of realizing partial Boolean functions by schemes consisting of functional elements

A. E. Andreev
Full-text PDF (705 kB) Citations (4)
Received: 27.12.1988
Bibliographic databases:
UDC: 519.7
Language: Russian
Citation: A. E. Andreev, “The complexity of realizing partial Boolean functions by schemes consisting of functional elements”, Diskr. Mat., 1:4 (1989), 36–45; Discrete Math. Appl., 1:3 (1991), 251–261
Citation in format AMSBIB
\Bibitem{And89}
\by A.~E.~Andreev
\paper The complexity of realizing partial Boolean functions by schemes consisting of functional elements
\jour Diskr. Mat.
\yr 1989
\vol 1
\issue 4
\pages 36--45
\mathnet{http://mi.mathnet.ru/dm939}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1041683}
\zmath{https://zbmath.org/?q=an:0733.94026|0719.94028}
\transl
\jour Discrete Math. Appl.
\yr 1991
\vol 1
\issue 3
\pages 251--261
Linking options:
  • https://www.mathnet.ru/eng/dm939
  • https://www.mathnet.ru/eng/dm/v1/i4/p36
    • This publication is cited in the following 4 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