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 Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 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
Received: 24.11.2005
Bibliographic databases:
Document Type: Article
UDC: 519.7+512.624
Language: Russian
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://mathscinet.ams.org/mathscinet-getitem?mr=2369799}
\zmath{https://zbmath.org/?q=an:1150.06315}
Linking options:
  • https://www.mathnet.ru/eng/vmumm3821
  • https://www.mathnet.ru/eng/vmumm/y2006/i5/p10
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:82
    Full-text PDF :24
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024