On complexity of multiplication in finite soluble groups
2015
Abstract 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.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
7
References
7
Citations
NaN
KQI