Journal of Symbolic Computation
Journal of Symbolic Computation
Computing with group homomorphisms
Journal of Symbolic Computation - Special issue on computational group theory: part 2
Constructing faithful representations of finitely-generated torsion-free nilpotent groups
Journal of Symbolic Computation
Efficient collection in infinite polycyclic groups
Journal of Symbolic Computation
Computer algebra handbook
Succinct representation of finite abelian groups
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Hi-index | 0.00 |
We describe experiments with various collection strategies for the multiplication of elements of a p-group. We conclude that collection from the left is a very good strategy, then analyse the computational complexity of collection from the left, and compare it with that of collection from the right. Collection from the left also appears to be an excellent strategy for the multiplication of elements of a finite soluble group.