DOI10.1016/S0747-7171(08)80081-8zbMath0726.20001OpenAlexW2059200303MaRDI QIDQ802744
Charles R. Leedham-Green, Leonard H. Soicher
Publication date: 1990
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80081-8
Analysis of algorithms and problem complexity (68Q25)
Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10)
Finite nilpotent groups, (p)-groups (20D15)
Software, source code, etc. for problems pertaining to group theory (20-04)
Derived series, central series, and generalizations for groups (20F14)
Commutator calculus (20F12)
Some remarks on the computation of complements and normalizers in soluble groups,
Computing in groups of Lie type,
The status of polycyclic group-based cryptography: a survey and open problems,
A nonlinear decomposition attack,
Efficient characteristic refinements for finite groups,
Space efficient representations of finite groups,
An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups,
An effective version of the Lazard correspondence.,
On complexity of multiplication in finite soluble groups.,
Using the Mal'cev correspondence for collection in polycyclic groups.,
A fast isomorphism test for groups whose Lie algebra has genus 2,
Computing with group homomorphisms,
COMPUTATION OF LOW-DIMENSIONAL (CO)HOMOLOGY GROUPS FOR INFINITE SEQUENCES OF p-GROUPS WITH FIXED COCLASS,
Polynomials describing the multiplication in finitely generated torsion-free nilpotent groups,
DFT-based word normalization in finite supersolvable groups.,
Computation of orders and cycle lengths of automorphisms of finite solvable groups,
Computing in Unipotent and Reductive Algebraic Groups,
Symbolic Collection using Deep Thought,
Constructing faithful representations of finitely-generated torsion-free nilpotent groups,
Efficient collection in infinite polycyclic groups.
