The algorithmic theory of polycyclic-by-finite groups

From MaRDI portal
Publication:1178862

DOI10.1016/0021-8693(91)90221-SzbMath0774.20019MaRDI QIDQ1178862

Derek J. S. Robinson, Frank B. Cannonito, Daniel Segal, Gilbert Baumslag

Publication date: 26 June 1992

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




Related Items

Computing presentations for subgroups of polycyclic groups and of context-free groups, On the orbit-stabilizer problem for integral matrix actions of polycyclic groups, Derivations and the permutability of subgroups in polycyclic-by-finite groups, A nonlinear decomposition attack, Algorithms for twisted conjugacy classes of polycyclic-by-finite groups, On the Frattini subgroup of a polycyclic group, Cryptanalysis of a combinatorial public key cryptosystem, Logspace and compressed-word computations in nilpotent groups, Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two, Post's correspondence problem: from computer science to algebra, Post's Correspondence Problem for hyperbolic and virtually nilpotent groups, The complexity of central series in nilpotent computable groups, Deciding isomorphy using Dehn fillings, the splitting case, Practical algorithms for polycyclic matrix groups, A practical algorithm for finding matrix representations for polycyclic groups, Detecting geometric splittings in finitely presented groups, Algorithms for polycyclic-by-finite groups, The isomorphism problem for torsion free nilpotent groups of Hirsch length at most \(5\), Sylow permutability in generalized soluble groups, Reverse mathematics and fully ordered groups, Representing Subgroups of Finitely Presented Groups by Quotient Subgroups, On the Fitting subgroup of a polycyclic-by-finite group and its applications, Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem, FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM, The Algorithmic Theory of Finitely Generated Metabelian Groups, Recognizing powers in nilpotent groups and nilpotent images of free groups, Linear groups and computation, The permutizer condition in infinite soluble groups, Algorithms for the Tits alternative and related problems., ONE-RELATOR QUOTIENTS OF GRAPH PRODUCTS, Testing polycyclicity of finitely generated rational matrix groups, Multiple conjugacy problem in graphs of free abelian groups., Orbit-stabilizer problems and computing normalizers for polycyclic groups.



Cites Work