Newman, MichaelNiemeyer, Alice2015-12-082015-12-080021-8693http://hdl.handle.net/1885/31964We 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.201510.1016/j.jalgebra.2014.08.0362015-12-08