Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnyi Analiz i Issledovanie Operatsii, 1996, Volume 3, Issue 1, Pages 43–52 (Mi da426)  
This article is cited in 1 scientific paper (total in 1 paper)

On the complexity of computations in finite nilpotent groups

V. V. Kochergin

M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (760 kB) Citations (1)
Received: 15.01.1996
Bibliographic databases:
UDC: 519.71
Language: Russian
Citation: V. V. Kochergin, “On the complexity of computations in finite nilpotent groups”, Diskretn. Anal. Issled. Oper., 3:1 (1996), 43–52
Citation in format AMSBIB
\Bibitem{Koc96}
\by V.~V.~Kochergin
\paper On the complexity of computations in finite nilpotent groups
\jour Diskretn. Anal. Issled. Oper.
\yr 1996
\vol 3
\issue 1
\pages 43--52
\mathnet{http://mi.mathnet.ru/da426}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1444680}
\zmath{https://zbmath.org/?q=an:0866.68049}
Linking options:
  • https://www.mathnet.ru/eng/da426
  • https://www.mathnet.ru/eng/da/v3/i1/p43
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:196
    Full-text PDF :72
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024