On complexity of multiplication in finite soluble groups
We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble group by restricting attention to certain polycyclic presentations of the group. As a corollary we give an upper bound for the complexity of collection from the left in finite p-groups in terms of the group order.
|Collections||ANU Research Publications|
|Source:||Journal of Algebra|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.