REVIEW
On complexity of multiplication in finite soluble groups
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.