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, 1995, Volume 2, Issue 1, Pages 7–20 (Mi da451)  
This article is cited in 5 scientific papers (total in 5 papers)

On the complexity of the realization of Boolean functions by circuits in an infinite basis

O. M. Kasim-zade

M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (1254 kB) Citations (5)
Received: 22.11.1994
Bibliographic databases:
UDC: 519.6
Language: Russian
Citation: O. M. Kasim-zade, “On the complexity of the realization of Boolean functions by circuits in an infinite basis”, Diskretn. Anal. Issled. Oper., 2:1 (1995), 7–20
Citation in format AMSBIB
\Bibitem{Kas95}
\by O.~M.~Kasim-zade
\paper On the complexity of the realization of Boolean functions by circuits in an infinite basis
\jour Diskretn. Anal. Issled. Oper.
\yr 1995
\vol 2
\issue 1
\pages 7--20
\mathnet{http://mi.mathnet.ru/da451}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1340107}
\zmath{https://zbmath.org/?q=an:0861.94034|0851.94033}
Linking options:
  • https://www.mathnet.ru/eng/da451
  • https://www.mathnet.ru/eng/da/v2/i1/p7
    • This publication is cited in the following 5 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