On complexity of multiplication in finite soluble groups
arXiv:1405.0150
Abstract
We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.