|
Zapiski Nauchnykh Seminarov POMI, 1995, Volume 227, Pages 106–112
(Mi znsl4270)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
Speeding up an algorithm to construct the Hall collection formula
A. I. Skopin, Yu. G. Teterin St. Petersburg Department of V. A. Steklov Institute of Mathematics, Russian Academy of Sciences
Abstract:
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.
Received: 01.02.1995
Citation:
A. I. Skopin, Yu. G. Teterin, “Speeding up an algorithm to construct the Hall collection formula”, Problems in the theory of representations of algebras and groups. Part 4, Zap. Nauchn. Sem. POMI, 227, POMI, St. Petersburg, 1995, 106–112; J. Math. Sci. (New York), 89:2 (1998), 1149–1153
Linking options:
https://www.mathnet.ru/eng/znsl4270 https://www.mathnet.ru/eng/znsl/v227/p106
|
Statistics & downloads: |
Abstract page: | 122 | Full-text PDF : | 45 |
|