On complexity of multiplication in finite soluble groups
classification
🧮 math.GR
keywords
complexityfinitegrouppolycyclicsolubleattentionboundcertain
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.