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, 2019, Volume 31, Issue 1, Pages 99–110
DOI: https://doi.org/10.4213/dm1511
(Mi dm1511)
 

This article is cited in 3 scientific papers (total in 3 papers)

Asymptotically best method for synthesis of Boolean recursive circuits

V. V. Zhukov, S. A. Lozhkin

Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics
Full-text PDF (530 kB) Citations (3)
References:
Abstract: Models of multi-output and scalar recursive Boolean circuits of bounded depth in an arbitrary basis are considered. Methods for lower and upper estimates for the Shannon function for the complexity of circuits of these classes are provided. Based on these methods, an asymptotic formula for the Shannon function is put forward. Moreover, in the above classes of recursive circuits, upper estimates for the complexity of implementation of some functions and systems of functions used in applications are obtained.
Keywords: recursive circuits of gates, complexity of Boolean functions, Shannon function, asymptotic estimates.
Funding agency Grant number
Russian Foundation for Basic Research 18-01-00800
Received: 26.03.2018
Revised: 03.06.2018
English version:
Discrete Mathematics and Applications, 2020, Volume 30, Issue 2, Pages 137–146
DOI: https://doi.org/10.1515/dma-2020-0013
Bibliographic databases:
Document Type: Article
UDC: 519.714.1
Language: Russian
Citation: V. V. Zhukov, S. A. Lozhkin, “Asymptotically best method for synthesis of Boolean recursive circuits”, Diskr. Mat., 31:1 (2019), 99–110; Discrete Math. Appl., 30:2 (2020), 137–146
Citation in format AMSBIB
\Bibitem{ZhuLoz19}
\by V.~V.~Zhukov, S.~A.~Lozhkin
\paper Asymptotically best method for synthesis of Boolean recursive circuits
\jour Diskr. Mat.
\yr 2019
\vol 31
\issue 1
\pages 99--110
\mathnet{http://mi.mathnet.ru/dm1511}
\crossref{https://doi.org/10.4213/dm1511}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3920657}
\elib{https://elibrary.ru/item.asp?id=37045016}
\transl
\jour Discrete Math. Appl.
\yr 2020
\vol 30
\issue 2
\pages 137--146
\crossref{https://doi.org/10.1515/dma-2020-0013}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000531071500006}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85085841119}
Linking options:
  • https://www.mathnet.ru/eng/dm1511
  • https://doi.org/10.4213/dm1511
  • https://www.mathnet.ru/eng/dm/v31/i1/p99
  • This publication is cited in the following 3 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