On complexity of multiplication in finite soluble groups.

DOI10.1016/J.JALGEBRA.2014.08.036zbMath1315.20012arXiv1405.0150OpenAlexW2007506249MaRDI QIDQ468715

M. F. Newman, Alice C. Niemeyer

Publication date: 7 November 2014

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.0150

zbMATH Keywords

finite soluble groupspolycyclic presentationscollection from the leftcomplexity of multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Generators, relations, and presentations of groups (20F05)

Related Items (4)

Universal covers of finite groups ⋮ Generation of finite groups with cyclic Sylow subgroups ⋮ Isomorphism testing of groups of cube-free order ⋮ Computation of orders and cycle lengths of automorphisms of finite solvable groups

Uses Software

• GAP
• Magma

Cites Work

• Collection from the left and other strategies
• Collection from the left
• The Magma algebra system. I: The user language
• Efficient collection in infinite polycyclic groups.
• Special polycyclic generating sequences for finite soluble groups.
• Unnamed Item

This page was built for publication: On complexity of multiplication in finite soluble groups.