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, or polycyclic, group by restricting attention to certain polycyclic presentations of the group. 
M.F. Newman and Alice C. Niemeyer
math.GR