RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

Zap. Nauchn. Sem. POMI, 1995 Volume 227, Pages 106–112 (Mi znsl4270)

This article is cited 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.

UDC: 512.540.5

Received: 01.02.1995


 English version:
Journal of Mathematical Sciences (New York), 1998, 89:2, 1149–1153

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024