Geodesic
Speeding up an algorithm to construct the Hall collection formula
Zapiski Nauchnykh Seminarov POMI, Problems in the theory of representations of algebras and groups. Part 4, Tome 227 (1995), pp. 106-112 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

A program that contains a recursive procedure inadmissibly increasing the running time of an algorithm was applied earlier for computer construction of the collection formula for Burnside groups. A program that remedies this flaw is suggested. Bibliography: 6 titles. 
@article{ZNSL_1995_227_a13,
     author = {A. I. Skopin and Yu. G. Teterin},
     title = {Speeding up an algorithm to construct the {Hall} collection formula},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {106--112},
     year = {1995},
     volume = {227},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_1995_227_a13/}
}
TY  - JOUR
AU  - A. I. Skopin
AU  - Yu. G. Teterin
TI  - Speeding up an algorithm to construct the Hall collection formula
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 1995
SP  - 106
EP  - 112
VL  - 227
UR  - http://geodesic.mathdoc.fr/item/ZNSL_1995_227_a13/
LA  - ru
ID  - ZNSL_1995_227_a13
ER  - 
%0 Journal Article
%A A. I. Skopin
%A Yu. G. Teterin
%T Speeding up an algorithm to construct the Hall collection formula
%J Zapiski Nauchnykh Seminarov POMI
%D 1995
%P 106-112
%V 227
%U http://geodesic.mathdoc.fr/item/ZNSL_1995_227_a13/
%G ru
%F ZNSL_1995_227_a13
A. I. Skopin; Yu. G. Teterin. Speeding up an algorithm to construct the Hall collection formula. Zapiski Nauchnykh Seminarov POMI, Problems in the theory of representations of algebras and groups. Part 4, Tome 227 (1995), pp. 106-112. http://geodesic.mathdoc.fr/item/ZNSL_1995_227_a13/