On complexity of multiplication in finite soluble groups

Date

2015

Authors

Newman, Michael
Niemeyer, Alice

Journal Title

Journal ISSN

Volume Title

Publisher

Elsevier

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.

Description

Keywords

Citation

Source

Journal of Algebra

Type

Journal article

Book Title

Entity type

Access Statement

License Rights

DOI

10.1016/j.jalgebra.2014.08.036

Restricted until