Affiliation:
1. Univ. of Sydney, Australia
Abstract
Computers are being applied to an increasingly diverse range of problems in group theory. The most important areas of application at present are coset enumeration, sub-group lattices, automorphism groups of finite groups, character tables, and commutator calculus. Group theory programs range from simple combinatorial or numerical programs to large symbol manipulation systems. In this survey the more important algorithms in use are described and contrasted, and results which have been obtained using existing programs are indicated. An extensive bibliography is included.
Publisher
Association for Computing Machinery (ACM)
Reference78 articles.
1. On computing on "ECM" representations of wreathproducts of finite groups;AIZENBERG N. N.;Kibernetika (Kiev),1965
2. BANDLER P.A. M.A. Th. U. of Manchester 1956. BANDLER P.A. M.A. Th. U. of Manchester 1956.
3. A calculus for a certain class of word problems in groups
4. Machine factorization of groups;BERNSTEIN H. J.;Math. Algorithms,1966
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献