Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
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., 2013, Volume 25, Issue 1, Pages 3–32 (Mi dm1218)  

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

On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2

S. B. Gashkov, I. S. Sergeev


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

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

English version:
Discrete Mathematics and Applications, 2013, 23:1, 1–37

Bibliographic databases:

UDC: 519.714
Received: 14.06.2012

Citation: S. B. Gashkov, I. S. Sergeev, “On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2”, Diskr. Mat., 25:1 (2013), 3–32; Discrete Math. Appl., 23:1 (2013), 1–37

Citation in format AMSBIB
\Bibitem{GasSer13}
\by S.~B.~Gashkov, I.~S.~Sergeev
\paper On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic~2
\jour Diskr. Mat.
\yr 2013
\vol 25
\issue 1
\pages 3--32
\mathnet{http://mi.mathnet.ru/dm1218}
\crossref{https://doi.org/10.4213/dm1218}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=3097583}
\elib{https://elibrary.ru/item.asp?id=20730459}
\transl
\jour Discrete Math. Appl.
\yr 2013
\vol 23
\issue 1
\pages 1--37
\crossref{https://doi.org/10.1515/dma-2013-001}
\elib{https://elibrary.ru/item.asp?id=20618190}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84880909880}


Linking options:
  • http://mi.mathnet.ru/eng/dm1218
  • https://doi.org/10.4213/dm1218
  • http://mi.mathnet.ru/eng/dm/v25/i1/p3

    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. S. B. Gashkov, “Arithmetic complexity of the Stirling transforms”, Discrete Math. Appl., 25:2 (2015), 83–92  mathnet  crossref  crossref  mathscinet  isi  elib  elib
    2. S. B. Gashkov, I. B. Gashkov, “Fast algorithm of square rooting in some odd characteistic finite field”, Moscow University Mathematics Bulletin, Moscow University Mchanics Bulletin, 73:5 (2018), 176–181  mathnet  crossref  mathscinet  zmath  isi
    3. S. B. Gashkov, I. S. Sergeev, “Umnozhenie”, Chebyshevskii sb., 21:1 (2020), 101–134  mathnet  crossref
    4. S. B. Gashkov, “Bystrye algoritmy resheniya uravnenii stepeni ne vyshe chetvertoi v nekotorykh konechnykh polyakh”, Vestn. Mosk. un-ta. Ser. 1. Matem., mekh., 2021, no. 3, 22–31  mathnet
  • Number of views:
    This page:684
    Full text:195
    References:56
    First page:50

     
    Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2021