V. V. Kochergin, “On the complexity of computation in finite Abelian, nilpotent and soluble groups”, Diskr. Mat., 5:1 (1993), 91

RUS ENG

JOURNALS PERSONS ORGANISATIONS CONFERENCES VIDEO LIBRARY PERSONAL OFFICE LIBRARY

	General information
	Latest issue
	Archive
	Impact factor

	Search
	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

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

Search through the site:

Find

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

Diskr. Mat., 1993, Volume 5, Issue 1, Pages 91–111 (Mi dm670)

PDF version

HTML version

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

V. V. Kochergin

UDC: 519.714+512.542

Received: 13.12.1991

Citation: V. V. Kochergin, “On the complexity of computation in finite Abelian, nilpotent and soluble groups”, Diskr. Mat., 5:1 (1993), 91–111

Citation in format AMSBIB:

\Bibitem{1}
\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://www.ams.org/mathscinet-getitem?mr=1221672}
\zmath{http://www.zentralblatt-math.org/zmath/search/?an=0840.20013}
\transl
\jour Discrete Math. Appl.
\yr 1993
\vol 3
\issue 3
\pages 297--319

Linking options:

http://mi.mathnet.ru/eng/dm670

http://mi.mathnet.ru/eng/dm/v5/i1/p91

Full-text article is available

Full text (in Russian): PDF file (1792 kB)

English version:
Discrete Mathematics and Applications, 1993, 3:3, 297–319

Review databases:

Citing articles on Google Scholar: Russian citations, English citations
Related articles on Google Scholar: Russian articles, English articles

Number of views:
This page:	32
Full text:	9

Registration