On complexity of multiplication in finite soluble groups
| dc.contributor.author | Newman, Michael | |
| dc.contributor.author | Niemeyer, Alice | |
| dc.date.accessioned | 2015-12-08T22:20:22Z | |
| dc.date.available | 2015-12-08T22:20:22Z | |
| dc.date.issued | 2015 | |
| dc.date.updated | 2015-12-08T08:30:02Z | |
| dc.description.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. | |
| dc.identifier.issn | 0021-8693 | |
| dc.identifier.uri | http://hdl.handle.net/1885/31964 | |
| dc.publisher | Elsevier | |
| dc.source | Journal of Algebra | |
| dc.title | On complexity of multiplication in finite soluble groups | |
| dc.type | Journal article | |
| local.bibliographicCitation.lastpage | 430 | |
| local.bibliographicCitation.startpage | 425 | |
| local.contributor.affiliation | Newman, Michael, College of Physical and Mathematical Sciences, ANU | |
| local.contributor.affiliation | Niemeyer, Alice, University of Western Australia | |
| local.contributor.authoruid | Newman, Michael, u4592491 | |
| local.description.notes | Imported from ARIES | |
| local.identifier.absfor | 010105 - Group Theory and Generalisations | |
| local.identifier.absseo | 970101 - Expanding Knowledge in the Mathematical Sciences | |
| local.identifier.ariespublication | u5328909xPUB87 | |
| local.identifier.citationvolume | 421 | |
| local.identifier.doi | 10.1016/j.jalgebra.2014.08.036 | |
| local.identifier.scopusID | 2-s2.0-84908567933 | |
| local.type.status | Published Version |