Collection from the left and other strategies
DOI10.1016/S0747-7171(08)80081-8zbMATH Open0726.20001OpenAlexW2059200303MaRDI QIDQ802744FDOQ802744
Authors: C. 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
Recommendations
- Efficient collection in infinite polycyclic groups.
- On complexity of multiplication in finite soluble groups.
- Intersecting subgroups of finite soluble groups
- scientific article; zbMATH DE number 177863
- Computing intersections and normalizers in soluble groups
- scientific article; zbMATH DE number 475370
- Collection from the left
- scientific article; zbMATH DE number 96386
- The algorithmic theory of polycyclic-by-finite groups
- Computing in general Abelian groups is hard
presentationefficiencygeneratorscomplexity analysispolycyclic groupsgenerating setp-groupsrelatorsfinite soluble groupcomputer- implementationslower p-central seriesordered normed word
Analysis of algorithms and problem complexity (68Q25) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Derived series, central series, and generalizations for groups (20F14) Finite nilpotent groups, (p)-groups (20D15) Commutator calculus (20F12) Software, source code, etc. for problems pertaining to group theory (20-04)
Cites Work
- Title not available (Why is that?)
- A Contribution to the Theory of Groups of Prime-Power Order
- Collection from the left
- Title not available (Why is that?)
- Title not available (Why is that?)
- Verifying nilpotence
- Determination of the lattices of subgroups of finite \(p\)-groups on a programmable electronic dual machine
Cited In (23)
- Using the Mal'cev correspondence for collection in polycyclic groups.
- Some remarks on the computation of complements and normalizers in soluble groups
- Constructing faithful representations of finitely-generated torsion-free nilpotent groups
- An effective version of the Lazard correspondence.
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups
- Polynomials describing the multiplication in finitely generated torsion-free nilpotent groups
- DFT-based word normalization in finite supersolvable groups.
- Collection from the left
- Computing in groups of Lie type
- Symbolic Collection using Deep Thought
- On complexity of multiplication in finite soluble groups.
- A nonlinear decomposition attack
- The status of polycyclic group-based cryptography: a survey and open problems
- Computation of orders and cycle lengths of automorphisms of finite solvable groups
- On the collection process for positive words
- Efficient characteristic refinements for finite groups
- Computing with group homomorphisms
- A fast isomorphism test for groups whose Lie algebra has genus 2
- Title not available (Why is that?)
- Computing in unipotent and reductive algebraic groups.
- Space efficient representations of finite groups
- Efficient collection in infinite polycyclic groups.
- Computation of low-dimensional (co)homology groups for infinite sequences of \(p\)-groups with fixed coclass.
This page was built for publication: Collection from the left and other strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802744)
