Diskretnaya Matematika
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


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Diskretnaya Matematika, 1993, Volume 5, Issue 1, Pages 91–111 (Mi dm670)  
This article is cited in 1 scientific paper (total in 1 paper)

On the complexity of computation in finite Abelian, nilpotent and soluble groups

V. V. Kochergin
Full-text PDF (1792 kB) Citations (1)
Received: 13.12.1991
Bibliographic databases:
UDC: 519.714+512.542
Language: Russian
Citation: V. V. Kochergin, “On the complexity of computation in finite Abelian, nilpotent and soluble groups”, Diskr. Mat., 5:1 (1993), 91–111; Discrete Math. Appl., 3:3 (1993), 297–319
Citation in format AMSBIB
\Bibitem{Koc93}
\by V.~V.~Kochergin
\paper On the complexity of computation in finite Abelian, nilpotent and soluble groups
\jour Diskr. Mat.
\yr 1993
\vol 5
\issue 1
\pages 91--111
\mathnet{http://mi.mathnet.ru/dm670}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1221672}
\zmath{https://zbmath.org/?q=an:0840.20013}
\transl
\jour Discrete Math. Appl.
\yr 1993
\vol 3
\issue 3
\pages 297--319
Linking options:
  • https://www.mathnet.ru/eng/dm670
  • https://www.mathnet.ru/eng/dm/v5/i1/p91
    • 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:274
    Full-text PDF :108
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024