Geodesic
On the complexity of computation in finite Abelian, nilpotent and soluble groups
Diskretnaya Matematika, Tome 5 (1993) no. 1, pp. 91-111.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DM_1993_5_1_a5,
     author = {V. V. Kochergin},
     title = {On the complexity of computation in finite {Abelian,} nilpotent and soluble groups},
     journal = {Diskretnaya Matematika},
     pages = {91--111},
     publisher = {mathdoc},
     volume = {5},
     number = {1},
     year = {1993},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1993_5_1_a5/}
}
TY  - JOUR
AU  - V. V. Kochergin
TI  - On the complexity of computation in finite Abelian, nilpotent and soluble groups
JO  - Diskretnaya Matematika
PY  - 1993
SP  - 91
EP  - 111
VL  - 5
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1993_5_1_a5/
LA  - ru
ID  - DM_1993_5_1_a5
ER  - 
%0 Journal Article
%A V. V. Kochergin
%T On the complexity of computation in finite Abelian, nilpotent and soluble groups
%J Diskretnaya Matematika
%D 1993
%P 91-111
%V 5
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1993_5_1_a5/
%G ru
%F DM_1993_5_1_a5
V. V. Kochergin. On the complexity of computation in finite Abelian, nilpotent and soluble groups. Diskretnaya Matematika, Tome 5 (1993) no. 1, pp. 91-111. http://geodesic.mathdoc.fr/item/DM_1993_5_1_a5/