Skip navigation
Skip navigation
Open Research will be down for maintenance between 8:00 and 8:15 am on Tuesday, December 1 2020.

On complexity of multiplication in finite soluble groups

Newman, Michael; Niemeyer, Alice

Description

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.

CollectionsANU Research Publications
Date published: 2015
Type: Journal article
URI: http://hdl.handle.net/1885/31964
Source: Journal of Algebra
DOI: 10.1016/j.jalgebra.2014.08.036

Download

There are no files associated with this item.


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator