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, 2020, Volume 32, Issue 2, Pages 15–31
DOI: https://doi.org/10.4213/dm1604 (Mi dm1604) 		 
This article is cited in 5 scientific papers (total in 5 papers)

On the complexity of implementation of a system of two monomials by composition circuits

S. A. Korneev

Lomonosov Moscow State University
Full-text PDF (494 kB) Citations (5)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1604
Abstract: The complexity of implementation of systems of monomials by composition circuits is studied. In such a model, the complexity is understood as the smallest number of composition operations required for computation of a system of monomials. The main result is an exact formula which, for an arbitrary pair of monomials, gives the complexity of their joint implementation by composition circuits.
Keywords: system of monomials, composition circuit, circuit of gates, computational complexity, circuit complexity.
Funding agency Grant number
Russian Foundation for Basic Research 18-01-00337-а
Received: 12.12.2019
English version:
Discrete Mathematics and Applications, 2021, Volume 31, Issue 2, Pages 113–125
DOI: https://doi.org/10.1515/dma-2021-0010
Bibliographic databases:
Document Type: Article
UDC: 519.714.7
Language: Russian
Citation: S. A. Korneev, “On the complexity of implementation of a system of two monomials by composition circuits”, Diskr. Mat., 32:2 (2020), 15–31; Discrete Math. Appl., 31:2 (2021), 113–125
Citation in format AMSBIB
\Bibitem{Kor20}
\by S.~A.~Korneev
\paper On the complexity of implementation of a~system of two monomials by composition circuits
\jour Diskr. Mat.
\yr 2020
\vol 32
\issue 2
\pages 15--31
\mathnet{http://mi.mathnet.ru/dm1604}
\crossref{https://doi.org/10.4213/dm1604}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4123497}
\elib{https://elibrary.ru/item.asp?id=46012248}
\transl
\jour Discrete Math. Appl.
\yr 2021
\vol 31
\issue 2
\pages 113--125
\crossref{https://doi.org/10.1515/dma-2021-0010}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000640071300003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85104509970}
Linking options:
  • https://www.mathnet.ru/eng/dm1604
  • https://doi.org/10.4213/dm1604
  • https://www.mathnet.ru/eng/dm/v32/i2/p15
    • 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
    		Дискретная математика
    Statistics & downloads:
    Abstract page:299
    Full-text PDF :46
    References:24
    First page:16
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024