Doklady Akademii Nauk SSSR
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 SSSR, 1965, Volume 163, Number 1, Pages 40–42 (Mi dan31288)  
This article is cited in 10 scientific papers (total in 10 papers)

CYBERNETICS AND THE REGULATION THEORY

Complexity of gating circuits realized by Boolean matrices with undetermined elements

É. I. Nechiporuk

Leningrad State University
Full-text PDF (406 kB) Citations (10)
Presented: P. S. Novikov
Received: 02.01.1965
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: É. I. Nechiporuk, “Complexity of gating circuits realized by Boolean matrices with undetermined elements”, Dokl. Akad. Nauk SSSR, 163:1 (1965), 40–42
Citation in format AMSBIB
\Bibitem{Nec65}
\by \'E.~I.~Nechiporuk
\paper Complexity of gating circuits realized by Boolean matrices with undetermined elements
\jour Dokl. Akad. Nauk SSSR
\yr 1965
\vol 163
\issue 1
\pages 40--42
\mathnet{http://mi.mathnet.ru/dan31288}
\zmath{https://zbmath.org/?q=an:0139.11703}
Linking options:
  • https://www.mathnet.ru/eng/dan31288
  • https://www.mathnet.ru/eng/dan/v163/i1/p40
    • This publication is cited in the following 10 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:132
    Full-text PDF :63
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024