RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor
Subscription

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


Diskr. Mat., 2014, Volume 26, Issue 1, Pages 49–74 (Mi dm1267)  

This article is cited in 1 scientific paper (total in 1 paper)

Order of power of planar circuits implementing Boolean functions

G. V. Kalachev

M. V. Lomonosov Moscow State University

DOI: https://doi.org/10.4213/dm1267

Full text: PDF file (492 kB)
References: PDF file   HTML file

English version:
Discrete Mathematics and Applications, 2014, 24:4, 185–205

Bibliographic databases:

Document Type: Article
UDC: 510.714.4
Received: 11.10.2013

Citation: G. V. Kalachev, “Order of power of planar circuits implementing Boolean functions”, Diskr. Mat., 26:1 (2014), 49–74; Discrete Math. Appl., 24:4 (2014), 185–205

Citation in format AMSBIB
\Bibitem{Kal14}
\by G.~V.~Kalachev
\paper Order of power of planar circuits implementing Boolean functions
\jour Diskr. Mat.
\yr 2014
\vol 26
\issue 1
\pages 49--74
\mathnet{http://mi.mathnet.ru/dm1267}
\crossref{https://doi.org/10.4213/dm1267}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3236302}
\elib{http://elibrary.ru/item.asp?id=21826363}
\transl
\jour Discrete Math. Appl.
\yr 2014
\vol 24
\issue 4
\pages 185--205
\crossref{https://doi.org/10.1515/dma-2014-0018}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84925354513}


Linking options:
  • http://mi.mathnet.ru/eng/dm1267
  • https://doi.org/10.4213/dm1267
  • http://mi.mathnet.ru/eng/dm/v26/i1/p49

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. G. V. Kalachev, “Generalization of complexity estimates for flat circuits realizing partial Boolean operators”, Moscow University Mathematics Bulletin, 73:3 (2018), 120–123  mathnet  crossref  isi
  • Дискретная математика
    Number of views:
    This page:224
    Full text:48
    References:37
    First page:37

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019