On complexity of multiplication in finite soluble groups
Group Theory
2014-08-28 v3
Abstract
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.
Keywords
Cite
@article{arxiv.1405.0150,
title = {On complexity of multiplication in finite soluble groups},
author = {M. F. Newman and Alice C. Niemeyer},
journal= {arXiv preprint arXiv:1405.0150},
year = {2014}
}