Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
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



Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2006, Number 5, Pages 10–16 (Mi vmumm3821)  

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

Mathematics

Complexity of Boolean schemes for arithmetic in some towers of finite fields

A. A. Burtsev, I. B. Gashkov, S. B. Gashkov


Full text: PDF file (1234 kB)

Bibliographic databases:
UDC: 519.7+512.624
Received: 24.11.2005

Citation: A. A. Burtsev, I. B. Gashkov, S. B. Gashkov, “Complexity of Boolean schemes for arithmetic in some towers of finite fields”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2006, no. 5, 10–16

Citation in format AMSBIB
\Bibitem{BurGasGas06}
\by A.~A.~Burtsev, I.~B.~Gashkov, S.~B.~Gashkov
\paper Complexity of Boolean schemes for arithmetic in some towers of finite fields
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 2006
\issue 5
\pages 10--16
\mathnet{http://mi.mathnet.ru/vmumm3821}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2369799}
\zmath{https://zbmath.org/?q=an:1150.06315}


Linking options:
  • http://mi.mathnet.ru/eng/vmumm3821
  • http://mi.mathnet.ru/eng/vmumm/y2006/i5/p10

    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, I. S. Sergeev, “Complexity of computation in finite fields”, J. Math. Sci., 191:5 (2013), 661–685  mathnet  crossref
    2. S. B. Gashkov, I. S. Sergeev, “On complexity and depth of Boolean circuits for multiplication and inversion over finite fields of characteristic 2”, Discrete Math. Appl., 23:1 (2013), 1–37  mathnet  crossref  crossref  mathscinet  elib  elib
  • Number of views:
    This page:17
    Full text:1

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